UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2002, Section 0101
Circuit Simplification I
Tuesday 11/19, 2002
Assigned Reading in Murdocca & Heuring: B.1-B.2
Assigned Reading in Neveln:
- Difference between the Mealy and the Moore models of the Mod 4
In the Mealy model, when the reset button is pushed, the
output is immediately "reset" to 00. Furthermore, the output
does not remain 00 for a full clock cycle, since the flip-flops
"latch" the 00 setting which makes the output 01 during the next
In the Moore model, the output is dependent only on the state bits
and not the input bits. When the reset button is pushed, it
sets the state bits to 00, but this does not change the output
until the next cycle. During the next cycle, the output is 00
for the full duration of that cycle.
- Using Karnaugh maps to simplify combinational logic circuits.
- Karnaugh maps find the smallest circuit in SOP or POS form.
The algorithm for finding the smallest SOP circuit is:
- Find all of the prime implicants.
- Include all essential prime implicants.
- Cover the remaining 1's by trying all possible combinations.
- Here "smallest" means the smallest number of minterms (for SOP)
and, among the formulas with the same number of minterms, the smallest
number of factors in the minterms.
- There may be smaller circuits with more than 2 levels. Also, for
functions with multiple bits of output, minimization should consider
common subexpressions in the formulas for each bit of output. Karnaugh
maps do not do this.
- In general circuit minimization is a hard problem (e.g.,
harder than cracking passwords).
Circuits in DigSim:
Following these links will launch the DigSim Java applet and
load the circuit described.
14 Nov 2003 10:23:02 EST
to Fall 2002 CMSC 313 Section Homepage