Topics for Test 2

Reasons for minimizing a circuit

Boolean algebra basis of minimization
- minimize a function using boolean algebra {xy' + xy = x, x + xy = x, and their duals)

Different kinds of minimization
- minimum number of gates
- minimum number of literals
- minimum number of chips

Minimum functions using a Karnaugh Map
- With or without don't cares
- Definition of and ability to identify prime implicants
- minimum Sum-of-Products
- minimum Product-of-Sums

Minimum functions using the Quine-McCluskey method
- Step 1: identifying all prime implicants
- Step 2: the Table of Choice
- Correspondence between Quine-McCluskey and Karnaugh map

Combinational circuit design from real-world problems
- identifying or deducing the required number of binary inputs and binary outputs
- when to use don't cares and when don't cares cannot be used
- generation of a truth table that solves the problem, followed by synthesis of a minimum circuit

MSI integrated circuits and their use to synthesize functions
- Decoders: block diagram, circuit diagram, enable, understanding
- Multiplexers: block diagram, circuit diagram, enable, understanding
- ROM: block diagram, internal operation, understanding
- ROM vs. PROM vs. EPROM vs. EEPROM
- PLA, PAL: understanding, symbolic programming

Timing diagrams
- Generation by hand of timing diagrams
- Identifying glitches