ACS134
DIGITAL & EMBEDDED SYSTEMS
LECTURE 6
MORE LOGIC OPERATIONS
2
Recap
• Expressions of Boolean functions
• Algebraic equations
• Symbols
• Truth tables
• Simplifications of Boolean expressions
• Complementing functions
• Canonical forms
3
Outline
• More logic gates
• NAND
• NOR
• XOR
• XNOR
4
The NAND gate
A
Y
B
• This is a NAND gate. It is a combination of an AND gate
followed by a NOT gate.
• NAND gates have several interesting properties:
• NAND(a,a)=(aa)’ = a’ = NOT(a) A B Y
• NAND’(a,b)=(ab)’’ = ab = AND(a,b) 0 0 1
• NAND(a’,b’)=(a’b’)’ = a+b = OR(a,b)
0 1 1
1 0 1
1 1 0
5
The NAND gate
NAND gates into other gates
What are these circuits?
A Y
A
NOT Gate Y
B
AND Gate
A
Y
B
OR Gate
6
The NAND gate
• These three properties show that a NAND gate with both
of its inputs driven by the same signal is equivalent to a
NOT gate.
• A NAND gate whose output is complemented is
equivalent to an AND gate, and a NAND gate with
complemented inputs acts as an OR gate.
• Therefore, we can use a NAND gate to implement all
three of the elementary operators (AND,OR,NOT).
• Therefore, ANY circuit can be constructed using only
NAND gates. Such a gate is said to be primitive,
universal or functionally complete.
7
The NOR gate
A
Y
B
• This is a NOR gate. It is a combination of an OR gate
followed by an inverter.
• NOR gates also have several interesting properties:
• NOR(a,a)=(a+a)’ = a’ = NOT(a) A B Y
• NOR’(a,b)=(a+b)’’ = a+b = OR(a,b) 0 0 1
• NOR(a’,b’)=(a’+b’)’ = ab = AND(a,b) 0 1 0
1 0 0
1 1 0
8
The NOR gate
NOR gates into other gates
What are these circuits?
A Y
NOT Gate A
B Y
OR Gate
A
Y
B
AND Gate
9
Functionally complete gates
• Just like the NAND gate, the NOR gate is functionally
complete, i.e. any logic function can be implemented
using just NOR gates.
• Both NAND and NOR gates are very valuable as any
design can be realised using either one.
• It is easier to build an IC chip using all NAND or NOR
gates than to combine AND, OR and NOT gates.
10
The XOR gate
(Exclusive-OR)
A
Y
B
• XOR gates assert their output when A B Y
exactly one of the inputs is asserted, 0 0 0
hence the name.
0 1 1
• The switching algebra symbol for this
operation is , i.e. 1 0 1
1 1 = 0 and 1 0 = 1. 1 1 0
11
The XNOR gate
(Exclusive-NOR)
A
Y
B
• XNOR is the complement of XOR gate. A B Y
• The switching algebra symbol for this 0 0 1
operation is , i.e. 0 1 0
1 1 = 1 and 1 0 = 0. 1 0 0
1 1 1
12
More inputs
NAND, NOR, XOR, XNOR can have equivalently more
inputs
A
B Y=(ABC)’
C
A
B Y=(A+B+C)’
C
A A B C Y
B Y=A B C 0 0 0 0
C 0
0
0
1
1
0
1
1
0 1 1 0
A 1 0 0 1
1 0 1 0
B Y 1 1 0 0
C 1 1 1 1
13
Private Study
• Review the slides
• Mano, Ciletti, Digital Design:
• Read Chapter 2: Sections 2.7 and 2.8
14
Summary
• More logic gates
• NAND
• NOR
• XOR
• XNOR
