E21 Digital Logic Design Lecture #3
Vocabulary for Minimization
-
Minterm: a term that is equal to 1 in only one row of a truth table (product of variables).
-
Maxterm: a term that is equal to 0 in only one row of a truth table (sum of variables).
-
Prime Implicant: an n-cube in a Karnaugh map that is not covered by any other n-cube.
-
Essential Prime Implicant: a prime implicant that contains a 1 that is not contained in any other PI.
5 and 6 Variable Karnaugh Maps
-
5-variable maps: 2 levels, can connect between levels
-
6-variable maps: 4 levels in a 4-dimensional space, can connect between levels
-
6 to 10 variables (or more) you need to use something else.
Tabular Methods for Minimization: Quine-McClusky
-
Find all of the size 1-subcubes (minterms in the function)
-
Let n = 1
-
Group minterms according to how many 1's they have
-
Compare minterms in adjacent groups to form (n+1)-subcubes
-
If you can form no (n+1)-subcubes, break out of the loop
-
Label the level n minterms as to whether they are covered by an (n+1)-subcube
-
Increment n and loop back to step 3
-
The minterms that are not covered form the set of prime implicants for this function
Minimal Cover Generation
-
The PIs from the table do not necessarily form the minimal expression for this function
-
First we need to discover all of the essential prime implicants (EPIs).
-
Write all of the PIs in a column, and on each PI's row, indicate which minterms it covers
-
Circle any minterm covered by only one PI (these are EPIs)
-
The EPIs must be included in the function
-
Now we need to intelligently select the remaining PIs to form the minimal cover
-
Form a POS of the, where each sum represents the PIs that cover a particular minterm
-
Multiply this out to get a SOP term
-
Remove any expressions from the SOP that are covered by simpler expressions
-
The remaining terms are the possible choices to combine with the EPI expressions
Technology Mapping
-
Converting AND-OR gates to NAND/NOR gates
-
Rule 1: xy = ((xy)')': AND gate is a NAND gate with an inverter on the output
-
Rule 2: x+y = ((x + y)')' = (x'y')': OR gate is a NAND gate with inverters on the inputs
-
Rule 3: xy = ((xy)')' = (x' + y')': AND gate is a NOR gate with inverters on the inputs
-
Rule 4: x+y = ((x + y)')': OR gate is NOR gate with an inverter on the output
-
Go through an example of SOP conversion to NAND gates
-
Two-stage process: conversion and optimization
-
Convert everything to the desired technology (NAND/NOR)
-
Remove duplicate inverters
Term Decomposition
-
Often we are using gate arrays (programmable logic) and are limited as to the number of inputs (e.g. 3)
-
Term decomposition converts m-input gates into n-input gates where n < m
-
Term decomposition must occur before conversion to a different technology (NAND)
-
Process:
-
Make a table with the levels, number of inputs, and number of gates
-
Each level takes an integral number of gates (inputs / inputs per gate)
-
Remaining inputs go to the next level
-
There will be log_n(m) inputs
-
There may be numerous decompositions
Decomposition and Timing Optimization Example
-
Carry lookahead generator