Digital Logic & Processors

Design concepts of Encoder &

Decoder
 ENCODER
• An encoder is a device which
converts numbers or characters or
symbols into a coded format.
• It reduces the number of bits needed
to represent the given information.
• Encoders are used for transmitting
the information. Thus the
transmission link uses fewer lines to
transmit the encoded information.
• Eg: QR code, calculators, Keyboard,
etc.
ENCODER
• Octal-to-Binary Encoder (8-to-3)
I7
I7 I6 I5 I4 I3 I2 I1 I0 Y2 Y1 Y0 I6
I5 Y2

Encoder
0 0 0 0 0 0 0 1 0 0 0

Binary
0 0 0 0 0 0 1 0 0 0 1 I4 Y1
0 0 0 0 0 1 0 0 0 1 0 I3 Y0
0 0 0 0 1 0 0 0 0 1 1 I2
0 0 0 1 0 0 0 0 1 0 0 I1
0 0 1 0 0 0 0 0 1 0 1 I0
0 1 0 0 0 0 0 0 1 1 0
1 0 0 0 0 0 0 0 1 1 1
 ENCODER Application

Compass Binary output

Direction

North 0 0 0
North-East 0 0 1

Encoder Navigation East 0 1 0

South-East 0 1 1
South 1 0 0
South-West 1 0 1
West 1 1 0
North-West 1 1 1
 DECODER
• Decoder is a combinational circuit that converts binary
information from n input lines to a maximum of 2n unique
output lines
 3–to-8 DECODER
Block Diagram
Logic Diagram

X Y Z F7 F6 F5 F4 F3 F2 F1 F0

0 0 0 0 0 0 0 0 0 0 1

0 0 1 0 0 0 0 0 0 1 0

0 1 0 0 0 0 0 0 1 0 0

0 1 1 0 0 0 0 1 0 0 0

1 0 0 0 0 0 1 0 0 0 0

1 0 1 0 0 1 0 0 0 0 0

1 1 0 0 1 0 0 0 0 0 0

1 1 1 1 0 0 0 0 0 0 0
DECODER Application
Addition ALU UNIT

 𝒀 𝟎 Addition
 𝒀 𝟏 Subtraction
0  𝑪 𝟎  𝒀 𝟐
Multiplication
 𝒀 𝟑
0  𝑪 𝟏 Decoder Division
 𝒀 𝟒 AND
0  𝑪 𝟐  𝒀 𝟓
OR
 𝒀 𝟔
NOT
 𝒀 𝟕
XOR

EN
Implementation of Boolean Functions using Decoder
Eg: Implement a Full adder using a suitable decoder and OR
gates.
S(x, y, z) = ∑m(1, 2, 4, 7)
C(x, y, z) = ∑m(3, 5, 6, 7) Y7
Y6
Y5
x I2
Y4
y I1
z Y3
I0
Y2
Y1
3x8
DecoderY
0

S C