340 likes | 524 Views
Quine-McCluskey Algorithm. Gautam Singh. Outline: step 1. Find Prime Implicants: Find all the minterms and sort by number of 1 bits (these are implicants) Compare every implicant with n 1-bits to all implicants with n+1 1-bits.
E N D
Quine-McCluskey Algorithm • Gautam Singh
Outline: step 1 Find Prime Implicants: Find all the minterms and sort by number of 1 bits (these are implicants) Compare every implicant with n 1-bits to all implicants with n+1 1-bits. Combine implicants that vary by a single bit. Replace the bit with an X. Check off implicants that have been 'used' Cross off duplicate implicants. Repeat steps 2 through 5 until no more minterms can be combined The prime implicants are those that were not checked off.
Outline: step 2 • Find Essential Prime Implicants: • Make a prime implicant chart with minterms as columns and prime implicants as rows • Look for columns that are 'covered' by only a single prime implicant. These are called “Essential Prime Implicants.” Put a check next to them and also check off all the columns they cover. • Among the remaining columns, select the fewest amount of remaining prime implicants that cover them.