Chapter 6

Digital Logic

Boolean Algebra

A	B	NAND $\overline{AB}$	NOR $\overline{A+B}$	XOR $A\oplus B$
0	0	1	1	0
0	1	1	0	1
1	0	1	0	1
1	1	0	0	0

• NAND Equivalent Gates

• Inv: $\overline{AA}=\bar{A}$, Nand with the inputs tied together
• AND: $\overline{(\stackrel{‾}{AB})}$, NAND followed by and Inv
• OR: $\overline{(\stackrel{‾}{A}\stackrel{‾}{B})}=A+B$

• De Morgan Laws