Example of a Combinatorial Circuit:

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)

such that Y may be equal to one of the inputs,

depending upon the control inputs.
1
 Example: A 4-to-1
Multiplexer
A 4-to-1 Multiplexer:

I0

2n inputs I1 Y
I2
1 output
I3

Enable S0 S1
(G) n control
inputs

2
Characteristic Table of a Multiplexer

If the MUX is enabled,

s0 s1
00 Y=I0
0 1 Y=I1
10 Y=I2
1 1 Y=I3

Putting the above information in the form of a Boolean

equation,
Y =G. I0. S1. S0 + G. I1. S1. S0 + G. I2. S1. S0 + G. I3.
S1. S0
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))
I
By using a 16-to-1 multiplexer:
0
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
S S S S
 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)