Scribd
Upload
101 views12 pages

Multiplexers: June 18, 2002 ©2000-2002 Howard Huang 1

Multiplexers are just as commonly used as the decoders we presented last time. They can be used to implement arbitrary functions. A 2-to-1 multiplexer sends one of 2n input lines to a single output line.

Uploaded by

padmakiran_nakka
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
101 views12 pages

Multiplexers: June 18, 2002 ©2000-2002 Howard Huang 1

Multiplexers are just as commonly used as the decoders we presented last time. They can be used to implement arbitrary functions. A 2-to-1 multiplexer sends one of 2n input lines to a single output line.

Uploaded by

padmakiran_nakka
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Multiplexers

• For the rest of the day, we’ll study multiplexers, which are just as
commonly used as the decoders we presented last time. Again,
– These serve as examples for circuit analysis and modular design.
– Multiplexers can implement arbitrary functions.
– We will actually put these circuits to good use in later weeks, as
building blocks for more complex designs.

June 18, 2002 ©2000-2002 Howard Huang 1


Multiplexers
• A 2n-to-1 multiplexer sends one of 2n input lines to a single output line.
– A multiplexer has two sets of inputs:
• 2n data input lines
• n select lines, to pick one of the 2n data inputs
– The mux output is a single bit, which is one of the 2n data inputs.
• The simplest example is a 2-to-1 mux:

Q = S’ D0 + S D1

• The select bit S controls which of the data bits D0-D1 is chosen:
– If S=0, then D0 is the output (Q=D0).
– If S=1, then D1 is the output (Q=D1).

2/15/2006 Additional Gates and Decoders 2


More truth table abbreviations
• Here is a full truth table for this 2-to-1 mux, S D1 D0 Q
based on the equation: 0 0 0 0
0 0 1 1
Q = S’ D0 + S D1 0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

• Here is another kind of abbreviated truth table. S Q


– Input variables appear in the output column. 0 D0
– This table implies that when S=0, the output 1 D1
Q=D0, and when S=1 the output Q=D1.
– This is a pretty close match to the equation.

2/15/2006 Additional Gates and Decoders 3


A 4-to-1 multiplexer
• Here is a block diagram and abbreviated truth table for a 4-to-1 mux.
• Be careful! In LogicWorks the multiplexer has an active-low EN input
signal. When EN’ = 1, the mux always outputs 1.

EN’ S1 S0 Q
0 0 0 D0
0 0 1 D1
0 1 0 D2
0 1 1 D3
1 x x 1

Q = S1’ S0’ D0 + S1’ S0 D1 + S1 S0’ D2 + S1 S0 D3

2/15/2006 Additional Gates and Decoders 4


Implementing functions with multiplexers
• Muxes can be used to implement arbitrary functions.
• One way to implement a function of n variables is to use an n-to-1 mux:
– For each minterm mi of the function, connect 1 to mux data input Di.
Each data input corresponds to one row of the truth table.
– Connect the function’s input variables to the mux select inputs.
These are used to indicate a particular input combination.
• For example, let’s look at f(x,y,z) = Σm(1,2,6,7).

x y z f
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
2/15/2006 Additional Gates and Decoders 5
A more efficient way
• We can actually implement f(x,y,z) = Σm(1,2,6,7) with x y z f
just a 4-to-1 mux, instead of an 8-to-1.
0 0 0 0
• Step 1: Find the truth table for the function, and 0 0 1 1
group the rows into pairs. Within each pair of rows, x
0 1 0 1
and y are the same, so f is a function of z only.
0 1 1 0
– When xy=00, f=z 1 0 0 0
– When xy=01, f=z’ 1 0 1 0
– When xy=10, f=0
1 1 0 1
– When xy=11, f=1
1 1 1 1

• Step 2: Connect the first two input variables of the


truth table (here, x and y) to the select bits S1 S0 of
the 4-to-1 mux.

• Step 3: Connect the equations above for f(z) to the


data inputs D0-D3.

2/15/2006 Additional Gates and Decoders 6


Example: multiplexer-based adder
• Let’s implement the adder carry function, C(X,Y,Z), with muxes.
• There are three inputs, so we’ll need a 4-to-1 mux.
• The basic setup is to connect two of the input variables (usually the
first two in the truth table) to the mux select inputs.

X Y Z C
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1 With S1=X and S0=Y, then
1 1 1 1 Q=X’Y’D0 + X’YD1 + XY’D2 + XYD3

Equation for the multiplexer


2/15/2006 Additional Gates and Decoders 7
Multiplexer-based carry
• We can set the multiplexer data inputs D0-D3, by fixing X and Y and
finding equations for C in terms of just Z.

X Y Z C
0 0 0 0
When XY=00, C=0
0 0 1 0
0 1 0 0
When XY=01, C=Z
0 1 1 1
1 0 0 0
When XY=10, C=Z
1 0 1 1
1 1 0 1
When XY=11, C=1
1 1 1 1

C = X’ Y’ D0 + X’ Y D1 + X Y’ D2 + X Y D3
= X’ Y’ 0 + X’ Y Z + X Y’ Z + X Y 1
= X’ Y Z + X Y’ Z + XY
= Σm(3,5,6,7)

2/15/2006 Additional Gates and Decoders 8


Multiplexer-based sum
• Here’s the same thing, but for the sum function S(X,Y,Z).

X Y Z S
0 0 0 0
When XY=00, S=Z
0 0 1 1
0 1 0 1
When XY=01, S=Z’
0 1 1 0
1 0 0 1
When XY=10, S=Z’
1 0 1 0
1 1 0 0 When XY=11, S=Z
1 1 1 1
S = X’ Y’ D0 + X’ Y D1 + X Y’ D2 + X Y D3
= X’ Y’ Z + X’ Y Z’ + X Y’ Z’ + X Y Z
= Σm(1,2,4,7)

2/15/2006 Additional Gates and Decoders 9


Dual multiplexer-based full adder
• We need two separate 4-to-1 muxes: one for C and one for S.
• But sometimes it’s convenient to think about the adder output as being
a single 2-bit number, instead of as two separate functions.
• A dual 4-to-1 mux gives the illusion of 2-bit data inputs and outputs.
– It’s really just two 4-to-1 muxes connected together.
– In LogicWorks, it’s called a “Mux-4x2 T.S.”

2/15/2006 Additional Gates and Decoders 10


Dual muxes in more detail
• You can make a dual 4-to-1 mux by
connecting two 4-to-1 muxes. (“Dual”
means “two-bit values.”)
• LogicWorks labels input bits xDy, which
means “the xth bit of data input y.”
• In the diagram on the right, we’re using
S1-S0 to choose one of the following
pairs of inputs:
– 2D3 1D3, when S1 S0 = 11
– 2D2 1D2, when S1 S0 = 10
– 2D1 1D1, when S1 S0 = 01
– 2D0 1D0, when S1 S0 = 00

You can see how 8-way multiplexer (k-to-1) can be


used to select from a set of (k) 8-bit numbers

2/15/2006 Additional Gates and Decoders 11


Summary
• A 2n-to-1 multiplexer routes one of 2n input lines to a single output line.
• Just like decoders,
– Muxes are common enough to be supplied as stand-alone devices for
use in modular designs.
– Muxes can implement arbitrary functions.
• We saw some variations of the standard multiplexer:
– Smaller muxes can be combined to produce larger ones.
– We can add active-low or active-high enable inputs.
• As always, we use truth tables and Boolean algebra to analyze things.

• Tune in tomorrow as we start to discuss how to build circuits to do


arithmetic.

2/15/2006 Additional Gates and Decoders 12

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy