Example of A Combinatorial Circuit: A Multiplexer (MUX)
Example of A Combinatorial Circuit: A Multiplexer (MUX)
A Multiplexer (MUX)
Consider an integer ‘m’, which is
constrained by the following relation:
m = 2 n,
where m and n are both integers.
A m-to-1 Multiplexer has
m Inputs: I , I , I , ................ I
0 1 2 (m-1)
one Output: Y
n Control inputs: S0, S1, S2, ...... S(n-1)
One (or more) Enable input(s)
I0
2n inputs I1 Y
I2
1 output
I3
Enable (G) S0 S1
n control inputs
2
Characteristic Table of a Multiplexer
3
Implementing Digital Functions:
by using a Multiplexer: Example 1
Implementation of F(A,B,C,D)=∑ (m(1,3,5,7,8,10,12,13,14), d(4,6,15))
By using a 16-to-1 multiplexer:
I0
0
I1
1
I2
0
I3
1
I4
0
I5
1
I6
0 F
I7
1
I8
1
I9
0
I10
1
I11
0
I12
1
I13
1
I14
1
I15
NOTE: 4,6 and 15 MAY BE 0
CONNECTED to either 0 or 1 4
S3 S2 S1 S0
Implementing Digital Functions:
by using a Multiplexer: Example 2
In this example to design a 3 variable logical function, we try to
use a 4-to-1 MUX rather than a 8-to-1 MUX.
F(x, y, z)=∑ (m(1, 2, 4, 7)