Multiplexer

• Also called data selectors.

• Basic function: select one of its data input
lines and place the corresponding information
onto a single output line.
• input bits needed to specify which input line
is to be selected.
– Place binary code for a desired data input line
onto its select input lines.
 Realization of 4-to-1 line multiplexer

Symbol

Logic Diagram

Truth Table
 Realization of 4-to-1 line multiplexer

• Alternate description:

• Algebraic description of multiplexer:

Building a Large Multiplexer
 Multiplexers
• One of the primary applications of
multiplexers is to provide for the transmission
of information from several sources over a
single path.
• This process is known as multiplexing.
• Demultiplexer = decoder with an enable input.
Multiplexer/Demultiplexer for information
transmission
 Logic Design with Multiplexers
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

The Boolean expression corresponding to this truth table can be

written as:
 Logic Design with Multiplexers
• The Boolean expression corresponding to this
truth table can be written as:

• The Boolean expression for an 8-to-1-line

multiplexer is:
 Logic Design with Multiplexers
• If E is logic-1 then the latter is transformed into the former by
replacing with , with , with , and with z.
• Placing on the select lines , respectively and placing the
functional values on data input lines .

𝑓0 𝐼0 8-to-1
𝑓1 𝐼1 MUX
𝑓2 𝐼2

𝑓3 𝐼3
𝑓
𝑓4 𝐼4

𝑓5 𝐼5

𝑓6 𝐼6

𝑓7 𝐼7

1 𝐸 𝑆 2 𝑆1 𝑆 0

𝑥 𝑦 𝑧
 Example:
0 0 0 1 𝐼0 8-to-1
MUX
0 0 1 0 𝐼1
0 1 0 1 𝐼2
0 1 1
1 𝐼3
1 0 0
0 𝐼4 𝑓
1 0 1
1 1 0 1 𝐼5
1 1 1 0 𝐼6
0 𝐼7

1 𝐸 𝑆 2 𝑆1 𝑆 0

𝑥 𝑦 𝑧
 Logic Design with Multiplexers
• If at least one input variable of a Boolean function
is available in both its complemented and
uncomplemented form, any -variable function is
realizable with a -to-1-line multiplexer.
• For the case of a 3-variable function, only a 4-to-1
multiplexer is needed.

• When E = 1, 4-to-1 Multiplexer has the form

 Logic Design with Multiplexers

4-to-1 Multiplexer has the form

• Realization of is obtained by placing the and

variables on the select lines, the single
variable functions on the data input lines and
let E = 1.
• Note: reduce to 0,1, or .
 Example

0 0 0
0 0 1 𝑓 0 ⋅ 𝑧+ 𝑓 1 ⋅ 𝑧
0 1 0 𝑓 2 ⋅ 𝑧 + 𝑓 3 ⋅𝑧
0 1 1 𝑓 4 ⋅ 𝑧+ 𝑓 5 ⋅ 𝑧
1 0 0
𝑓 6 ⋅ 𝑧+ 𝑓 7 ⋅ 𝑧
1 0 1
1 1 0
1
1 1 1

𝑥 𝑦
 Example

0 0 0 𝑧
0 0 1 𝑧
0 1 0
0
0 1 1
1
1 0 0
1 0 1
1
1 1 0
1 1 1

𝑥 𝑦
 Logic Design with Multiplexers and K-
maps
• Consider 3-variable Karnaugh map. Assume x is placed
on the line and y is placed on the line.
• We get that the output is:
• corresponds to those cells in which
• corresponds to those cells in which
• corresponds to those cells in which
• corresponds to those cells in which
 K-map representation

00 01 11 10
𝑆1 = 𝑥 𝐼 0 𝐼1

𝐼 2 𝐼 3

𝑧 𝑧 𝑧 𝑧
0 1 0 1 0 1 0 1

map map map map

 Example

0 0 0 00 01 11 10
0 0 1 1 0 1 1
0 1 0 𝑆1 = 𝑥
0 1 1 0 1 0 0
1 0 0
1 0 1 𝑧 𝑧 𝑧 𝑧
0 1 0 1 0 1 0 1
1 1 0
1 1 1 1 0 1 1 0 1 0 0
map map map map

𝐼 0= 𝑧 𝐼 1 =1 𝐼 2= 𝑧𝐼 3=0
 Realization

0 0 0 𝑧
0 0 1 1
0 1 0 𝑧
0 1 1
0
1 0 0
1 0 1
1
1 1 0
1 1 1

𝑥 𝑦
 Alternative Structures

00 01 11 10
𝑥

Note that order of variables on

input lines matters!

00 01 11 10
𝑆 0= 𝑥 𝐼 0 𝐼 2

𝐼1 𝐼 3
 8-to-1-line multiplexers and 4-variable
Boolean functions
• Can do the same thing, three variables are placed on select
lines, inputs to the data lines are single-variable functions.
• Example:
 Can we do better?
• By allowing realizations of -variable functions
as inputs to the data input lines, -to-1-line
multiplexers can be used in the realization of -
variable functions.
• E.g.: input variables w and x are applied to
the select inputs. Functions of the y and z
variables appear at the data input lines.
K-map Structure
 Example:
𝑓 ( 𝑥 , 𝑦 , 𝑧 )=∑𝑚(0,1,5,6,7,9,13,14)
Example
 Example

Multiplexer Tree