Está en la página 1de 4

# Multiplexer and Demultiplexer

1 2

1 2

## 2 Input Multiplexor 2-Mux Boolean Function

Inputs: I0 and I1 • The output depends on I0 and I1
Selector: S I0
Output: O • The output also depends on S !!!
Mux O
I1 • We must treat S as an input.
If S is a 0: O=I0
If S is a 1: O=I1
S
3 4

3 4

1
2-Mux Truth Table 2-Mux Boolean Expression
Abbreviated S I0 I1 O0
Truth Table 0 0 0 0
0 0 1 0
S O
0 1 0 1
0 I0 0 1 1 1 terms
1 0 0 0
1 I1 Since S can’t be both a 1 and a 0, only
1 0 1 1
one of the terms can be a 1.
1 1 0 0
1 1 1 1

5 6

5 6

## 2-Mux Logic Design

4 Input Multiplexor
S I0 I1
• If we have 4 inputs, we need to have 2
selection bits: S0 S1

S0 S1 O
O Abbreviated
0 0 I0
Truth Table 0 1 I1
1 0 I2
1 1 I3
7 8

7 8

2
Combinational Logic design using
One Possible 4-Mux
MUX
S’0S’1
• Use of MUX offers the following
S’0S1
I1 • Boolean simplification is not required
S0S’1 O • It minimizes the IC package count
I2
S 0S 1 • Logic design is simplified
I3

9 10

9 10

11 12

11 12

3
A B F Example
0 0 0
0 1 C’
1 0 1
4:1 1 1 C’

B C F
0 0 A
0 1 A
A 1 0 1
A 4:1 1 1 0
1 F
0
13 14
BC

13 14