LOGIC GATES AND LOGIC CIRCUITS

Gate: A logic gate is the building block of any digital / electronic circuit.

Types:

1. NOT
2. AND B Main / Basic Gates

3. OR E
4. NAND
5. NOR B
Universal Gates
6. XOR E
7. XNOR L

Note:

 All gates have exactly 1 output always

Truth Table:
1. NOT GATE

Symbols:

A X
A X NOT

Function:

A  X (where X = A )

Truth Table:

21 = 2 combinations

INPUTS OUTPUT
A X
0 1
1 0

Rule:

NOT gate gives an output of 1 if input is 0 and vice versa. It is also known as an INVERTER.
2. AND GATE

Symbols:

A A
X X
B AND
B

Function:

A , B  X (where X = A.B )

Truth Table:

22 = 4 combinations

INPUTS OUTPUT
A B X
0 0 0
0 1 0
1 0 0
1 1 1

23 = 8 combinations

A B C X
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 1

Rule:
AND gate gives an output of 1 if all inputs are 1 and a 0 in all other cases.

24 = 16 combinations
 A B C D X
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 0
1 1 1 0 0
1 1 1 1 1

3. OR GATE
Symbols:
A
A
X X
B OR
B

Function:

A , B  X (where X = A+B )

Truth Table:

22 = 4 combinations

INPUTS OUTPUT
A B X
0 0 0
0 1 1
1 0 1
1 1 1

23 = 8 combinations

A B C X
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1

Rule:
OR gate gives an output of 0 if all inputs are 0 and a 1 in all other cases.

24 = 16 combinations
A B C D X
 0 0 0 0 0
0 0 0 1 1
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 1
0 1 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

4. NAND GATE

Symbols:

A
X
B NAND
 A
X
B

Function:

A , B  X (where X = (A.B) ’ )

Truth Table:

22 = 4 combinations

INPUTS OUTPUT
A B X
0 0 1
0 1 1
1 0 1
1 1 0

23 = 8 combinations

A B C X
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0

Rule:
NAND gate gives an output of 0 if all inputs are 1 and a 1 in all other cases.

5. NOR GATE

Symbols:

A A
X X
B B NOR
Function:

A , B  X (where X = (A + B) ‘ )

Truth Table:

22 = 4 combinations

INPUTS OUTPUT
A B X
0 0 1
0 1 0
1 0 0
1 1 0

23 = 8 combinations

A B C X
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 0

Rule:
NOR gate gives an output of 1 if all inputs are 0 and a 0 in all other cases.

6. XOR (Exclusive-OR) GATE

Symbols:
A
A
X X
B XOR
B
 Function:

A , B  X (where X = ( A . B ) + ( A . B ) )

Truth Table:

22 = 4 combinations

INPUTS OUTPUT
A B X
0 0 0
0 1 1
1 0 1
1 1 0

23 = 8 combinations

A B C X
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1

Rule:
XOR gate gives an output of 1 if there is an odd number of 1’s in the inputs and 0 in all other
cases.

Alternate circuit for XOR Gate

1. At commercial level a circuit is build up using only a single type of gate, as it is cheaper to
manufacture.

2. NAND gate circuits are cheaper than NOR gate circuits

EXAMPLE QUESTIONS

1.
 M

Working Space
A B C X
M N O
0 0 0 0 1 1 0
1
0 0 1 0 0 1 0
0 1 0 1 1 0 0
1
0 1 1 1 0 1 1
1 0 0 1 1 1 1
1
1 0 1 1 0 1 1
1 1 0 1 1 0 0
1
1 1 1 1 0 1 1

2.
3.
X = 1 if (A = 1 XOR C = 1) OR (B = 1 NAND C = NOT 1)

4.

X = 1 if ( A = 1 AND B = 1 ) AND ( B = NOT 1 OR C = 1 )

5.
X = 1 if ( S1 = 1 ) AND ( P1 = NOT 1 XOR P2 = NOT 1 )
S1

P1 X

P2