UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2002, Section 0101
Circuit Simplification II
Thursday 11/21, 2002
[Up]
[Previous Lecture]
[Next Lecture]
Assigned Reading in Murdocca & Heuring: B.3
Assigned Reading in Neveln:
Assigned: HW5
Due: DigSim2
Topics Covered:
- More examples of circuit simplification using
Karnaugh maps.
- Went over the design of a sequence detector with 1 input bit
and 1 output bit. The output is a 1 if the last three inputs contain
exactly two 1's. This detector is discussed in the textbook. We
took the extra step of simplifying the combinational logic and
implementing the detector using gates instead of MUXes.
Circuits in DigSim:
Following these links will launch the DigSim Java applet and
load the circuit described.
Last Modified:
22 Jul 2024 11:27:51 EDT
by
Richard Chang
to Fall 2002 CMSC 313 Section Homepage