ECE 249 - Lecture 20 To 26 - Unit 5 - Introduction To Combinational Logic Circuits
ECE 249 - Lecture 20 To 26 - Unit 5 - Introduction To Combinational Logic Circuits
How many
Design of
inputs and
Truth Table
outputs
A2 A1 A0 HIGH OUTPUT
0 0 0 Y0
0 0 1 Y1
0 1 0 Y2
0 1 1 Y3
1 0 0 Y4
1 0 1 Y5
1 1 0 Y6
1 1 1 Y7
A3 Y0
A2
A1
4:16
Y15
Decoder
A0
EN
4:16 Decoder using 3:8 Decoder
4:16 Decoder using 2:4 Decoder
Basic Electronics and Electrical
Engineering: ECE 249
UNIT V: Introduction to
Combinational Logic Circuits
Lecture No.: 24
Topic: Multiplexers and
Implementation of Boolean
Functions using Multiplexers
o Since there are ‘n’ selection lines, there will be 2n possible combinations of zeros and ones. So,
each combination will select only one data input. Multiplexer is also called as Mux.
S1 S0 Y
0 0 I0
0 1 I1
1 0 I2
1 1 I3
Prepared and Delivered By: Irfan Ahmad Pindoo 49
Boolean Function Implementation using Multiplexer
Implement f = 𝟏, 𝟑, 𝟓, 𝟔 using 4:1 MUX?
NOR GATE
NAND GATE
XNOR GATE
XOR GATE
NOT GATE
If more than one input is active High, then the encoder produces an output, which may not be
the correct code. For example, if both Y3 and Y6 are ‘1’, then the encoder produces 111 at the
output. This is neither equivalent code corresponding to Y3, when it is ‘1’ nor the equivalent
code corresponding to Y6, when it is ‘1’.
So, to overcome these difficulties, we should assign priorities to each input of encoder. Then,
the output of encoder will be the binary code corresponding to the active High inputs, which
has higher priority. This encoder is called as priority encoder.
In addition to the two outputs x and y, the circuit has a third output designated by V; this is a
valid bit indicator that is set to 1 when one or more inputs are equal to 1. If all inputs are 0,
there is no valid input and V is equal to 0.
The other two outputs are not inspected when V equals 0 and are specified as don’t-care
conditions.