Page 14 - INTRODUCTION_TO_LOGIC CIRCUITS_Neat
P. 14
Boolean Algebra
F BOOLEAN ALGEBRA
0=0
1=x
x=x
X’ = 0
= yx
yz) = (xy)z
yz = (x + y)(x + z)
y)’ = x’ + y’
[15] and [16] : De Morgan’s Theorem
nction
n functions
g different logic gates
erters
Boolean function may be convenient
or NORs
s Theorem
+ y’= (xy)’
OR → NAND
Computer Architectures Lab
