Multiplexers
A multiplexer circuit has a number of data inputs, one or more select inputs, and one
output.
It passes the signal value on one of the data inputs to the output.
The data input is selected by the values of the select inputs.
2-to-1 multiplexer
• The select input, s, chooses as
the output of the multiplexer
either input w0 or w1.
• Hence,
when s=0, the o/p becomes wo
when s=1, the o/p becomes w1
1
4-to-1 multiplexer
Four data inputs, w0, . . . ,w3, and two select inputs, s1 and s0.
As shown in the truth table in part
(b), the two-bit number represented
by s1s0 selects one of the data inputs as
the output of the multiplexer.
Realizes the multiplexer function
It is possible to build larger
multiplexers using the same approach
A multiplexer that has n data inputs,
w0, . . . ,wn−1, requires log2n select
inputs.
2
Larger multiplexers can also be constructed from smaller multiplexers. For example, the
4-to-1 multiplexer can be built using three 2-to-1 multiplexers as illustrated below.
Exercise: Construct a 16-to-1 multiplexer using 4-to-1 multiplexers.
3
crossbar switch
A circuit that has n inputs and k outputs, whose sole function is to provide a capability
to connect any input to any output, is usually referred to as an n×k crossbar switch.
Implementing 2×2 crossbar using 2-to-1 multiplexers:
The function of the circuit is to allow
either of its inputs (x1 and x2) to be
connected to either of its outputs,
under the control of another input, s.
If s = 0, the crossbar connects x1 to y1
and x2 to y2, while if s = 1, the crossbar
connects x1 to y2 and x2 to y1.
4
Synthesis of Logic Functions Using Multiplexers
Example #1: Exclusive-OR [ XOR]
Consider the function f = w1 ⊕ w2
Directly straightforward f can be implemented using a 4-to-1 multiplexer.
The values of f in each row of the truth
table are connected as constants to the
multiplexer data inputs.
5
By manipulating the truth table, f can be implemented by a single 2-to-1
multiplexer.
w1 in this example, is chosen as the
select input of the 2-to-1 multiplexer.
The truth table is redrawn to indicate
the value of f for each value of w1.
When w1 = 0, f has the same value as
input w2, and when w1 = 1, f has the
value of w2.
6
Example #2: Three-input majority function
Consider the truth table for the three-input majority function, f.
The truth table is modified to implement the function using a 4-to-1
multiplexer.
w1 and w2 are chosen as the multiplexer select inputs.
Exercise: Implement the function f = w1⊕w2⊕w3 using 2-to-1 multiplexers.
7
Multiplexer Synthesis Using Shannon’s Expansion
Shannon’s Expansion Theorem
Any Boolean function f (w1, . . . ,wn) can be written in the form
This expansion can be done in terms of any of the n variables.
Example: Implement the function
using a 2-to-1 multiplexer and any other necessary gates.
Soln.
Shannon’s expansion using w1 gives
The corresponding circuit becomes
8
Exercise:
#1)* Implement the previous example using a 4-to-1 multiplexer. Give the Shannon’s
expansion in terms of two variables.
#2) Implement the three-input majority function using only 2-to-1 multiplexers. Use
Shannon’s expansion.
9
Demultiplexer
A demultiplexer is a circuit that performs the opposite function of multiplexer,
namely, placing the value of a single data input onto multiple data outputs.
1-to-4 demultiplexer
The data-input line goes to all of the AND gates. The two data-select lines enable
only one gate at a time, and the data appearing on the data-input line will pass
through the select gate to the associated data-output line.
10
