1 / 29

Quine-McCluskey Algorithm

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.

gypsy
Download Presentation

Quine-McCluskey Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quine-McCluskey Algorithm • Gautam Singh

  2. 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.

  3. 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.

More Related