Professional Documents
Culture Documents
Combinational Circuit Analysis and Design
Combinational Circuit Analysis and Design
Combinational Circuit Analysis and Design
Z. Jerry Shi
Department of Computer Science and Engineering
University of Connecticut
Examples?
Combinational analysis
Signal expressions
If you know the implementation details
Multiply out:
F = ((X + Y) Z) + (X Y Z)
= (X Z) + (Y Z) + (X Y Z)
F = ((X + Y) Z) + (X Y Z)
= (X+Y+X) (X+Y+Y) (X+Y+Z) (Z+X)(Z+Y)(Z+ Z)
= 1 1 (X+Y+Z) (X+) (Y+Z) 1
= (X+Y+Z) (X+) (Y+Z)
Cancelling bubbles
G(W, X, Y, Z) = W X Y + Y Z
(a) Two-level AND-OR
(b) Two-level NAND-NAND
(c) 2-input gates only
Sum-of-products Form
AND-OR
NAND-NAND
Product-of-sums form
OR-AND
NOR-NOR
AB
B+C
= AB+BC(B + C)
BC(B + C)
BC
Brute-force design
Truth table
Canonical sum (Sum of minterms)
Example: Design a circuit to detect
prime numbers between 0-15
Given a 4-bit input, N3N2N1N0,
produce a 1 output for N = 1, 2, 3, 5,
7, 11, 13 and a 0 otherwise
row N3 N2 N1 N0 F
0 0 0 0 0 0
1 0 0 0 1 1
2 0 0 1 0 1
3 0 0 1 1 1
4 0 1 0 0 0
5 0 1 0 1 1
6 0 1 1 0 0
7 0 1 1 1 1
8 1 0 0 0 0
9 1 0 0 1 0
10 1 0 1 0 0
11 0 0 1 1 1
12 1 1 0 0 0
13 1 1 0 1 1
14 1 1 1 0 0
15 1 1 1 1 0
Algebraic simplification
Theorem T10: X Y + X Y ' = X
Resulting circuit
Pass or fail
There are three components in a course: homework (H), lab(L), and exam (E). You
pass the course (P) only if you pass two or more components
Design goals
Function
Delay
Area
Power
Testability
Reliability
Security