Scribd
Upload
711 views25 pages

CS 8351 Digital Principles and System Design: Multiplexers

The document discusses multiplexers, which are combinational logic circuits that select one of several input lines and output the signal to a single output line, controlled by a selection input. It describes 2-to-1 and 4-to-1 multiplexers through truth tables and logic diagrams. Multiplexers have applications in signal routing and implementing Boolean functions. Boolean functions can be mapped to multiplexers by treating selection lines as variables and inputs as constants or variables.

Uploaded by

padmaa1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
711 views25 pages

CS 8351 Digital Principles and System Design: Multiplexers

The document discusses multiplexers, which are combinational logic circuits that select one of several input lines and output the signal to a single output line, controlled by a selection input. It describes 2-to-1 and 4-to-1 multiplexers through truth tables and logic diagrams. Multiplexers have applications in signal routing and implementing Boolean functions. Boolean functions can be mapped to multiplexers by treating selection lines as variables and inputs as constants or variables.

Uploaded by

padmaa1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

CS 8351

DIGITAL PRINCIPLES AND SYSTEM


DESIGN
MULTIPLEXERS
Multiplexer( Data Selector)
 A multiplexer or MUX, is a combinational circuit with more than
one input line, one output line and more than one selection line.
 A multiplexer selects binary information present from one of many
input lines, depending upon the logic status of the selection inputs,
and routes it to the output line.
 A multiplexer is also called a data selector, since it selects
one of many inputs and steers the binary information to the
output line.
Block Diagram of Mux

Other Names:-
 Data Selector
 Many to one Converter
Parallel to Serial Converter
Data Routing
Logic function Generator
Control Sequencer
Types of Mux
 2 to 1 mux
 4 to 1 mux
 8 to 1 mux
 16 to 1 mux
 32 to 1 mux
2 to 1 mux

 No. of input lines are 2 (i.e) 2n


 No. of output line is 1

2n =2 where n=1
 Selection line n=1
Truth Table & Logical Expression

Y= S’I0 +SI1
Logic Diagram

The circuit has two data input lines, one output line and one
selection line, S.
When S= 0, the upper AND gate is enabled and I0 has a path to
the output.
When S=1, the lower AND gate is enabled and I1 has a path to
the output.
4 to 1 mux

 No. of input lines are 4 (i.e) 2n


 No. of output line is 1

2n =4 where n=2
 Selection line n=2
Truth Table & Logical Expression

Y= S1’S0’I0 +S1’S0I1+S1S0’I2+S1S0I3
Logic Diagram

If S1S0=00 ; I0 is selected
If S1S0=01 ; I1 is selected
If S1S0=10 ; I2 is selected
If S1S0=11; I3 is selected
Application

 The multiplexer is a very useful MSI function and has various ranges of
applications in data communication.
 Signal routing and data communication are the important applications of
a multiplexer.
 It is used for connecting two or more sources to guide to a single
destination among computer units and it is useful for constructing a
common bus system.
 One of the general properties of a multiplexer is that Boolean functions
can be implemented by this device.
Implementation of Boolean Function
using MUX
 Any Boolean or logical expression can be easily implemented using a
multiplexer. If a Boolean expression has (n+1) variables, then n‘ of
these variables can be connected to the select lines of the multiplexer.
 The remaining single variable along with constants 1 and 0 is used as
the input of the multiplexer.
 By this method any logical expression can be implemented.
 In general, a Boolean expression of (n+1) variables can be
implemented using a multiplexer with 2n inputs.
Rules for Implementation of Boolean
Function using Mux
 If both the minterms in the column are not circled, apply 0 to the
corresponding input.
 If both the minterms in the column are circled, apply 1 to the
corresponding input.
 If the bottom minterm is circled and the top is not circled, apply
A to the input.
 If the top minterm is circled and the bottom is not circled,
applyA‘ to the input.
Implement the following boolean function using 4: 1 multiplexer F (A, B, C)
= ∑m (1, 3, 5,6).

 Variables, n= 3 (A, B, C)
 Select lines= n-1 = 2 (S1, S0)
 2n-1 to MUX i.e., 22 to 1 = 4 to 1
 MUX Input lines= 2n-1 = 22 = 4 (D0, D1, D2, D3)
Mux Implementation
2. Implement the following boolean function using 4: 1
multiplexer F (A, B, C) = ∑m (1, 2, 6, 7)

Mux Implementation
3. F ( A, B, C) = ∑m (1, 2, 4, 5)
4. F( P, Q, R, S)= ∑m (0, 1, 3, 4, 8, 9, 15)
5. Implement the Boolean function using 8: 1multiplexer.
F (A, B, C, D) = A’BD’ + ACD + B’CD + A’C’D
MUX Implementation
Implement a 4:1 mux using 2:1 Mux
Implement 16:1 Mux using 8:1 Mux
Implement 16:1 Mux using 4:1 Mux

You might also like