UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2003, Section 0101

Circuit Simplification I

Thursday 11/06, 2001

Up]

Assigned Reading in Murdocca & Heuring:  B.1-B.2

Assigned Reading in Neveln:   

Assigned:  hw5

Due:  hw4

Topics Covered:

• Slides are available in PDF: Slides20.pdf
• Reviewed Karnaugh-map algorithm.
• Notes on the limitations of Karnaugh maps.
• In general, circuit minimization is a very difficult problem.
• Discussed Homework 5.