Professional Documents
Culture Documents
EECS150 - Digital Design: Lecture 4 - Boolean Algebra I
EECS150 - Digital Design: Lecture 4 - Boolean Algebra I
EECS150 - Digital Design: Lecture 4 - Boolean Algebra I
unique
? Truth Table
not ?
unique
gate
Boolean not
representation
Expression unique
(schematic)
[convenient for [close to
manipulation] implementaton]
R = A + B,
c is carry out
carry to
next stage
r = a XOR b
c = a AND b = ab r = a XOR b XOR ci
co = ab + aci + bci
Fall 2002 EECS150 – Lec4-bool1 Page 9, 9/5 9am
4-bit Adder Example
• In general:
ri = ai XOR bi XOR cin
cout = aicin + aibi + bicin = cin(ai + bi) + aibi
“ripple” adder
Fall 2002 EECS150 – Lec4-bool1 Page 10, 9/5 9am
4-bit Adder Example
• Graphical Representation of FA-cell • Alternative Implementation
ri = ai XOR bi XOR cin (with 2-input gates):
cout = aicin + aibi + bicin ri = (ai XOR bi) XOR cin
cout = cin(ai + bi) + aibi
00 0 00 0 0 1
01 1 01 0 1 0
10 1 10 0
11 1 11 1
Any law that is true for an expression is also true for its dual.
Distributive Laws:
x (y + z) = (x y) + (x z) x +(y z) = (x + y)(x + z)
“Simplification” Theorems:
x y + x y’ = x (x + y) (x + y’) = x
x+xy=x x (x + y) = x
DeMorgan’s Law:
(x + y + z + …)’ = x’y’z’ (x y z …)’ = x’ + y’ +z’
= 1
1
0
1
0
0
1
0
1
0
1
0