Quine McCluskey Method/Step by step procedure/example 2/digital electronics

Описание: Quine McCluskey Method is a Tabulation method used to minimize the Boolean functions.Quine McCluskey is a Convenient method to simplify Boolean expressions with more than 4 variables.

Karnaugh map is a method used for reducing the boolean expression.
K map is a graphical method used to obtain the simplified expression.
The size of K-map depends on the number of variables used.
Depending upon the number of input variables, it can have 4 cells, 8 cells, 16 cells or 32 cells.
Normally K-map is preferred for less than 5 variables.
Min terms refers to the product of the input variables.
Max term refers to the sum of input variables
As the number of variables increases in K map, the complexity increases.

K map can be plotted from truth table or Boolean expression
Steps for Quine Mc Clusky method
1.Group minterms according to the number of ones.
2.Check for one bit change in adjacent groups
3.Place the ‘-‘ symbol where there is a bit change accordingly and keep the remaining bits the same.
4.Repeat steps 2 to 3 until all the bits present in the table are different.
5. Make a prime implicant table
6.Place ‘ . ’ in the minterms which are covered by each prime implicant.
7. If the minterm is covered by only one prime implicant, then it is an essential prime implicant.
8.Add the essential prime implicants to the simplified boolean function.
------------------------------------------------------------------------------------------------------
Ch 12: 2 variable K-map
   • Karnaugh Map (K- map) /rules/2 variable K ...  
Ch 13:3 variable K-map
   • Karnaugh Map (K- map) /rules/3 variable K ...  
Ch 14:4 variable K-map
   • Karnaugh Map (K- map) /4 variable K map pr...  

Ch1: Introduction to number system
   • Number system in digital electronics-Learn...  

Ch2: Decimal to binary conversion
   • Decimal to binary number conversion. How t...  

Ch3: Decimal to Octal conversion
   • Decimal to octal number conversion. How to...  

Ch4: Decimal to Hexa decimal conversion
   • Decimal to hexa decimal number conversion....  

Ch5: Binary to any conversion system
   • Binary to decimal/Octal/Hexadecimal conver...  
CH6:logic gates
   • Logic gates-AND/OR/NOT/ universal gates- N...  

Ch7:Boolean algebra
   • Boolean algebra/Boolean laws/De Morgan's T...  

Ch 8:Realization of gates using NAND and NOR logic
   • Realization of gates using universal gates...  

Ch 9: Complement of a Boolean expression
   • How to find the complement of a boolean ex...  

Ch 10: Min term and Max term : Sum of min terms and Product of Max terms
   • How to find the complement of a boolean ex...  
...................................................................................................................................................
SUBSCRIBE
   / @readelectricvehicle6078   sub_confirmation=1

CONTACT US

In case of any query, please do
email : [email protected].
Blog: https://readelectricvehicle.wordpress...
TWITTER :   / readevehicle  
----------------------------------------------------------------------------------------------------------------
#QuineMccluskey, #digitalelectronics, #booleanexpression, #readelectricvehicle