1 / 17

Quine-McCluskey Tabular Minimization

Quine-McCluskey Minimization (cont.). Terms are initially listed one per line in groupsEach group contains terms with the same number of true and complemented variablesTerms are listed in numerical order within groupTerms and implicants are identified using one of three common notationsfull vari

nova
Download Presentation

Quine-McCluskey Tabular Minimization

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 (Tabular) Minimization Two step process utilizing tabular listings to: Identify prime implicants (implicant tables) Identify minimal PI set (cover tables) All work is done in tabular form Number of variables is not a limitation Basis for many computer implementations Don�t cares are easily handled Proper organization and term identification are key factors for correct results

    2. Quine-McCluskey Minimization (cont.) Terms are initially listed one per line in groups Each group contains terms with the same number of true and complemented variables Terms are listed in numerical order within group Terms and implicants are identified using one of three common notations full variable form cellular form 1,0,- form

    3. Notation Forms Full variable form - variables and complements in algebraic form hard to identify when adjacency applies very easy to make mistakes Cellular form - terms are identified by their decimal index value Easy to tell when adjacency applies; indexes must differ by power of two (one bit) Implicants identified by term nos. separated by comma; differing bit pos. in () following terms

    4. Notation Forms (cont.) 1,0,- form - terms are identified by their binary index value Easier to translate to/from full variable form Easy to identify when adjacency applies, one bit is different - shows variable(s) dropped when adjacency is used Different forms may be mixed during the minimization

    5. Example of Different Notations

More Related