Quine-McCluskey Algorithm - PDF Free Download

Quine-McCluskey Algorithm Useful for minimizing equations with more than 4 inputs. Like K-map, also uses combining theorem Allows for automation Chapter <>

Edward McCluskey (99-06) Pioneer in Electrical Engineering First president of IEEE Professor at Princeton, then Stanford 955: Quine-McCluskey Algorithm Chapter <>

Quine-McCluskey Algorithm Method:. s Table: List each minterm, sorted by the number of s it contains. Combine minterms.. Prime Implicant Table: When you can t combine anymore, list prime implicants and the minterms they cover. 3. Select Prime to cover all minterms. Chapter <3>

Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 Chapter <4>

s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Order the minterms by the number of s they have. Chapter <5>

s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5) 0- m(,3) -0 m(,6) Combine minterms in adjacent groups (starting with the top group). To combine terms, minterm can differ (be or 0) in only place - indicates don t care Chapter <6>

s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5) 0- m(,3) -0 m(,6) Size 4 0-- m(0,,,3) Combine minterms in adjacent groups (starting with the top group). To combine terms, minterm can differ (be or 0) in only place - (don t care) acts like another variable (0,, -) Match up - first. Chapter <7>

s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5)* 0- m(,3) -0 m(,6)* Size 4 0-- m(0,,,3)* List prime implicants: Largest implicants containing a given minterm For example m(0,) is an implicant but not a prime implicant, because m(0,,,3) is a larger implicant containing those minterms. However, m(,5) is a prime implicant no larger implicant exists that contains minterm 5. Chapter <8>

Prime Implicant Table s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5)* 0- m(,3) -0 m(,6)* Size 4 0-- m(0,,,3)* List prime implicants. Prime m(0,,,3) m(,5) m(,6) Minterms 0 3 5 6 ABC 0 - - - 0-0 Show which of the required minterms each includes. Chapter <9>

Prime Implicant Table s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Prime m(0,,,3) m(,5) m(,6) Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Minterms 0 3 5 6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5)* 0- m(,3) -0 m(,6)* Size 4 0-- m(0,,,3)* ABC 0 - - - 0-0 Select columns with only. Corresponding prime implicants must be included in equation. Chapter <0>

Prime Implicant Table s Table Quine-McCluskey Example ABC Y 000 00 00 0 00 0 0 0 0 of 's 0 Prime m(0,,,3) m(,5) m(,6) Size 000 m0 00 m 00 m 0 m3 0 m5 0 m6 Minterms 0 3 5 6 Size 00- m(0,) 0-0 m(0,) 0- m(,3) -0 m(,5)* 0- m(,3) -0 m(,6)* Y = A + BC + BC ABC 0 - - - 0-0 Chapter <> Size 4 0-- m(0,,,3)* Select columns with only. Corresponding prime implicants must be included in equation.

Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 Chapter <3>

s Table Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 of 's 3 Size 000 m 000 m 000 m4 000 m8 00 m3 00 m6 00 m9 00 m0 0 m4 Chapter <4>

s Table Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 of 's 3 Size 000 m 000 m 000 m4 000 m8 00 m3 00 m6 00 m9 00 m0 0 m4 Size 00- m(,3) -00 m(,9) 00- m(,3) 0-0 m(,6) -00 m(,0) 0-0 m(4,6) 00- m(8,9) 0-0 m(8,0) -0 m(6,4) -0 m(0,4) Chapter <5>

s Table Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 of 's 3 Size 000 m 000 m 000 m4 000 m8 00 m3 00 m6 00 m9 00 m0 0 m4 Size 00- m(,3)* -00 m(,9)* 00- m(,3)* 0-0 m(,6) -00 m(,0) 0-0 m(4,6)* 00- m(8,9)* 0-0 m(8,0)* -0 m(6,4) -0 m(0,4) Size 4 --0 m(,6,0,4)* Chapter <7>

Prime Implicant Table s Table Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 of 's 3 Size 000 m 000 m 000 m4 000 m8 00 m3 00 m6 00 m9 00 m0 0 m4 Prime m(,6,0,4) m(,3) m(,9) m(,3) m(4,6) m(8,9) m(8,0) Size 00- m(,3)* -00 m(,9)* 00- m(,3)* 0-0 m(,6) -00 m(,0) 0-0 m(4,6)* 00- m(8,9)* 0-0 m(8,0)* -0 m(6,4) -0 m(0,4) Minterms 4 8 9 4 0-0 Chapter <8> Size 4 --0 m(,6,0,4)* ABCD --0 00- -00 0-0 00-00-

Prime Implicant Table Quine-McCluskey Example ABCD Y 0000 0 000 000 00 000 00 0 00 0 0 000 00 00 0 0 00 0 0 0 0 0 Prime m(,6,0,4) m(,3) m(,9) m(,3) m(4,6) m(8,9) m(8,0) Minterms 4 8 9 4 ABCD --0 00- -00 00-0-0 00-0-0 Chapter <9>