CHAPTER TWO:

DIGITAL LOGIC GATES

1
 INTRODUCTION
❑ Digital (logic) circuits operate in the binary mode where each input & output
voltage is either a 0 or 1;

❑ The interconnection of gates to perform a variety of logical operations is

called logic design.
❑ Some of the more common terms in the digital logic field are shown.
 …INTRODUCTION
❑ In Boolean algebra there are only three basic operation; OR, AND, and
NOT.

❑ These basic operations are called logic operations

❑ Digital circuits called logic gates can be constructed from diode, transistors,
and resistors connected.
❖ In such a way that the circuit output is the result of a basic logic operation (OR,
AND, NOT) performed on the inputs.
 1. THE INVERTER
❑ The inverter (NOT circuit) Performs inversion or complementation.

❖ Changes a logic level to the opposite

4
❖0 (LOW) ➔ 1(HIGH) ; 1 ➔ 0;
1

❑ Symbols used:
1

(a) Distinctive shape symbols (b) Rectangular outline symbols

with negation indicators with polarity indicators
 1. The Inverter…
❑ Inverter operation: HIGH (1) HIGH (1)
LOW (0) LOW (0)
t1 t2 t1 t2
Input Output
Pulse Pulse
A X
0 1
❑ Logic expression for an Inverter: A X=A
1 0

❑ Inverter Truth Tables

X is the complement of A
A X is the inverse of A
Input Output X is NOT A
"A bar"
"not A"
LOW (0) HIGH (1)
HIGH (1) LOW (0)
 …1. DISCRETE NOT GATE
A Y
❑ When the input signal to the base of transistor, is
0 1
zero, IB = 0, as no current flows in collector circuit
and the output voltage remains equal to VCC i.e. 5V. 1 0
❑ When the input signal is high, IB flows through the
Truth Table
transistor resulting in flow of saturation current in
collector circuit.
❑ Because of high collector current there will be large
voltage drop across the collector resistance RC and s
output Vout will be at low level
Transistor as Inverter
 2. THE AND GATE
❑ AND gate can have two or more inputs with a single output.

❑ Performs ‘logical multiplication’

❖ If all of the input are HIGH, then the output is HIGH.

7
❖ If any of the input are LOW, then the output is LOW.

❑ Symbols used:
&
A A
X X
B B

(a) Distinctive shape (b) Rectangular outline with

the AND (&) qualifying symbol
 …2. AND GATE TRUTH TABLE
Three Input Inputs Output
A B C X
Two Input 0 0 0 0

8
Inputs Output 0 0 1 0
0 1 0 0
0 1 1 0
A B X
1 0 0 0
0 0 0 1 0 1 0
0 1 0 1 1 0 0
1 0 0 1 1 1 1

1 1 1
…2. AND GATE OPERATION WITH WAVEFORM INPUTS

9
10

…2. LOGIC EXPRESSIONS FOR AND GATE:

❑ AND gate performs Boolean multiplication.

❑ If input variable is A and B, output variable is X, then the Boolean

expression is X = AB.

❑ Boolean multiplication follows the same basic rule as binary multiplication:

0.0=0
0.1=0
1.0=0
1.1=1
 …2. DISCRETE AND GATE

+5 V

A B X

11
0 0 0
A Y 0 1 0
1 0 0
B
1 1 1

Two-input
diode AND Gate Two-input Truth Table
Transistor AND gate
 3. THE OR GATE
❑ An OR gate can have two or more inputs with a single output and Performs
‘logical addition’

❖ If any of the input are HIGH, then the output is HIGH.

12
❖ If all of the input are LOW, then the output is LOW
❑ Symbols used:
1
A A
X X
B B

(a) Distinctive shape (b) Rectangular outline with

the OR ( 1) qualifying symbol
 …3. THE OR GATE OPERATION:
LOW (0)
LOW (0)
LOW (0) A
X=A+B
B
HIGH (1)
HIGH (1)
LOW (0)
A
B X=A+B+C
C
LOW (0)
HIGH (1)
HIGH (1)
A
B X=A+B+C+D
HIGH (1) C
HIGH (1) D
HIGH (1)
…3. OR GATE TRUTH TABLE & OPERATION WITH WAVEFORM
Inputs Output
❑ OR Gate Truth Table of two inputs
A B X
0 0 0
0 1 1
1 0 1
❑ OR Gate Operation with Waveform
1 1 1
15

…3. LOGIC EXPRESSIONS FOR OR GATE:

❑ OR gate performs Boolean addition

❑ Boolean addition follows the basic rules as follows:

A+B=X
0+0=0
0+1=1
1+0=1
1+1=1
 …3. DISCRETE OR GATE

D1
A B Y

16
A Y
0 0 0
B
0 1 1
D2
R
1 0 1
1 1 1
Two-input
diode OR Gate Truth Table
Two-input
Transistor OR gate
 4. THE NAND GATE
❑ NAND ➔ NOT-AND combines the AND gate and an inverter
❑ Used as a universal gate

❖ Combinations of NAND gates can be used to perform AND, and inverter

operations
❖ If all or any of the input are LOW, then the output is HIGH.
❖ If all of the input are HIGH, then the output is LOW
❑ Symbol used:
&
A A A
X
X X B
B B (b) Rectangular outline: 2 input
NAND gate with polarity indicator
(a) Distinctive shape: 2 input NAND
gate and its NOT/AND equivalent 17
 …4. THE NAND GATE OPERATION:
LOW (0)
HIGH (1)
LOW (0)

A
HIGH (1)
HIGH (1) X
LOW (0) B

LOW (0)
HIGH (1) A
HIGH (1) B X
C
HIGH (1)
LOW (0)
HIGH (1)
…4. NAND GATE TRUTH TABLE & OPERATION WITH WAVEFORM

19
 …4. LOGIC EXPRESSIONS FOR NAND GATE:
❑ Boolean expression for NAND is a combination of AND gate and Inverter.

❑ Boolean expressions.
INPUTS OUTPUT

20
A B AB AB = X
0 0 0 0.0 = 0 = 1
0 1 0 0.1 = 0 = 1
1 0 0 1.0 = 0 = 1
1 1 1 1.1 = 1 = 0
21

…4. UNIVERSALITY OF NAND GATES

A Y = A.A = A
 INVERTER


A AB
Y = AB
B

AND

A
A


Y=A B

B
B OR
…4. DISCRETE NAND GATE
A B Y
0 0 1
0 1 1
1 0 1
1 1 0

Truth Table

Discrete two-input NAND gate

 5. THE NOR GATE
❑ NOR ➔ NOT-OR combines the OR gate and an inverter
❑ Used as a universal gate

❖ Combinations of NOR gates can be used to perform OR and inverter

23
operations
❖ If
all or any of the input are HIGH, then the output is LOW.
❖ If all of the input are LOW, then the output is HIGH
❑ Symbol used:

A A 1
X A
X X
B B B

(a) Distinctive shape: 2 input NOR (b) Rectangular outline with

gate and its NOT/OR equivalent the OR ( 1) qualifying symbol
 …5. THE NOR GATE OPERATION:
LOW (0)
HIGH (1)
LOW (0)
A

24
X
HIGH (1) B
LOW (0)
LOW (0)
A
LOW (0) B X
LOW (0) C
HIGH (1)

HIGH (1)
LOW (0)
HIGH (1)
…5. NOR GATE TRUTH TABLE & OPERATION WITH WAVEFORM
INPUTS OUTPUT
A
X=A+B A B X
B
0 0 1
0 1 0
1 0 0

25
1 1 0

1 0 0 1 0

1 0 1 0 0

0 1 0 0 1

t1 t2 t3 t4 t5
 …5. LOGIC EXPRESSIONS FOR NOR GATE:
❑ Boolean expression for NOR is a combination of OR and Inverter Boolean
expressions.
INPUTS OUTPUT

26
A B A+B A+B=X
0 0 0 0+0 = 0 = 1
0 1 1 0+1 = 1 = 0
1 0 1 1+0 = 1 = 0
1 1 1 1+1 = 1 = 0
 …5.UNIVERSALITY OF NOR GATES
❑ Similarly,
it can be shown that NOR gates can be arranged to implement any
of the Boolean operations. See fig. below
A Y = A+A= A
 INVERTER


A A+B
Y = A+B
B

OR

A
A


Y = A+B

B
B AND
 …5. DISCRETE NOR GATE
A B Y
❑ A simple 2-input logic gate can be
0 0 1
constructed using RTL Resistor-
0 1 0
transistor switches connected together
1 0 0
directly to the transistor bases.
❑ Both transistors must be cut-off “OFF”
1 1 0

for an output at Y. Truth Table

Discrete two-input NOR gate

 6.THE EXCLUSIVE-OR GATE
❑ Combines basic logic circuits of AND, OR and Inverter.
❑ Its has only 2 inputs
❑ Used as a universal gate

29
❖ If both of the input are at the same logic level, then the output is LOW.

❖ If both of the input are at opposite logic levels, then the output is HIGH
❑ Symbol used:
A =1
X A
X
B B

(a) Distinctive shape (b) Rectangular outline

 …6. THE XOR GATE OPERATION:
LOW (0)
LOW (0)
LOW (0)

30
HIGH (1)
HIGH (1)
LOW (0) A
X
LOW (0) B
HIGH (1)
HIGH (1)

HIGH (1)
LOW (0)
HIGH (1)
…6. XOR GATE TRUTH TABLE &OPERATION WITH WAVEFORM
INPUTS OUTPUT
A
X = AB + BA A B X
B
=A B 0 0 0
0 1 1
1 0 1
1 1 0

31
1 0 0 1 0

1 0 1 0 0

0 0 1 1 0

t1 t2 t3 t4 t5
 7. THE EXCLUSIVE-NOR GATE
❑ Has only 2 inputs, but output of XNOR is the opposite of XOR
❖ If both of the input are at the same logic level, then the output is HIGH.

32
❖ If both of the input are at opposite logic levels, then the output is LOW.
❑ Symbol used:

A =1
A
X X
B B

(a) Distinctive shape (b) Rectangular outline

 …7. THE XNOR GATE OPERATION:
LOW (0)
LOW (1)
LOW (0)

33
HIGH (1) A
HIGH (0) X
LOW (0) B

LOW (0)
HIGH (0)
HIGH (1)

HIGH (1)
LOW (1)
HIGH (1)
…7. NOR GATE TRUTH TABLE & OPERATION WITH WAVEFORM
INPUTS OUTPUT
A
X=A B A B X
B
0 0 1
0 1 0
1 0 0

34
1 1 1

1 0 0 1 0

1 0 1 0 0

1 1 0 0 1

t1 t2 t3 t4 t5
35

XOR VS XNOR

1 0 0 1 0

1 0 1 0 0

0 0 1 1 0

XOR

1 1 0 0 1

XNOR
t1 t2 t3 t4 t5