Combinational Logic Circuits

TA C162 Computer Programming 1(Section-3)

Topics to discuss
Multiplexer Universal Gates

TA C162 Computer Programming 1(Section-3)

Multiplexer (Mux)
Multi-plex (duplex; quadruplex; eightplex ) permitting the simultaneous transmission of two or more trains of signals or messages over a single channel

TA C162 Computer Programming 1(Section-3)

Multiplexer (Mux)
Multi-plex (duplex; quadruplex; eightplex ) permitting the simultaneous transmission of two or more trains of signals or messages over a single channel Select one of the inputs and connect it to the output
Select input (S) decides which of the input is connected to the output

TA C162 Computer Programming 1(Section-3)

Multiplexer (MUX)
n-bit selector and 2n inputs, one output
output equals one of the inputs, depending on selector

TA C162 Computer Programming 1(Section-3)

Multiplexer (MUX)
n-bit selector and 2n inputs, one output
output equals one of the inputs, depending on selector

4-to-1 MUX
TA C162 Computer Programming 1(Section-3)

Multiplexer (MUX)

TA C162 Computer Programming 1(Section-3)

Multiplexer (MUX)

Do it Construct an 8 input MUX, where each input is of 2 bits

TA C162 Computer Programming 1(Section-3)

Universal Gates
Implements any Boolean function without the need to use any other gates
NAND, NOR

NAND and NOR are the cheapest and smallest to manufacture in Integrated Circuits compared to AND and OR

TA C162 Computer Programming 1(Section-3)

NAND Gate (repeated)

TA C162 Computer Programming 1(Section-3)

NAND as Universal Gate

Implementing NOT using NAND
X

X Z

NAND gate truth table

X
0 0

Y
0

Z X Y

1 1 1
0

Short the inputs together

1
0

1 1

TA C162 Computer Programming 1(Section-3)

NAND as Universal Gate

Implementing OR using NAND
X Z

Logic expression for OR gate:

X Y X Y
Using DeMorgans Theorem,
X Z Y
TA C162 Computer Programming 1(Section-3)

X Y

NAND as Universal Gate

Implementing AND using NAND
X
Z Y

Logic expression for AND gate:

X Y
X
Y

X Y
Z

TA C162 Computer Programming 1(Section-3)

Implementing circuits only using NAND

TA C162 Computer Programming 1(Section-3)

Multiplexer using only NAND Gates

TA C162 Computer Programming 1(Section-3)

Multiplexer using only NAND Gates

TA C162 Computer Programming 1(Section-3)

Multiplexer using only NAND Gates

TA C162 Computer Programming 1(Section-3)

Multiplexer using only NAND Gates

Make this OR as NAND

TA C162 Computer Programming 1(Section-3)

Procedure for implementing using only NANDs

Draw the logical circuit using AND, OR, NOT Replace each AND, OR, NOT with their NAND Equivalents Cancel back-to-back NOTs Replace remaining NOT gates with their NAND Equivalents

TA C162 Computer Programming 1(Section-3)

Procedure for implementing using only NANDs

Draw the logical circuit using AND, OR, NOT Replace each AND, OR, NOT with their NAND Equivalents Cancel back-to-back NOTs Replace remaining NOT gates with their NAND Equivalents Your Homework : Implement Half Adder, Full Adder, Comparator, Decoder Using only NANDs

TA C162 Computer Programming 1(Section-3)

Your Homework: Implement the following combinational circuit using only NAND Gates

TA C162 Computer Programming 1(Section-3)

Multiplexer using only NAND Gates

TA C162 Computer Programming 1(Section-3)

NOR Gate (repeated)

TA C162 Computer Programming 1(Section-3)

NOR as Universal Gate

X Z X Z X

Z
Y

X Z Y X

X Z Z Y Y
TA C162 Computer Programming 1(Section-3)

Implementing circuits only using NOR

TA C162 Computer Programming 1(Section-3)