Scribd
Upload
9 views

ECE 103 Lecture16

Uploaded by

justinhunt018
Copyright
© © All Rights Reserved
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
9 views

ECE 103 Lecture16

Uploaded by

justinhunt018
Copyright
© © All Rights Reserved
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/ 17

2

3
MULTIPLEXERS (MUX)
 A multiplexer is a combinational circuit that selects binary information from one of many input lines and
directs it to a single output line.
 The selection of a particular input line is controlled by a set of selection lines.
 Normally, there are 2n input lines and n-selection lines and 1 output line.
 Select line combinations determine which input is selected and the data at the selected input line is
transferred to the output.

The multiplexer is often


two-to-one-line multiplexer: labelled “MUX”
• two data input lines,
• one output line, and
• one selection line S.

When S = 0, I0 has a path to the output.


When S = 1, I1 has a path to the output.

Y
4
Implementation of 2x1 MUX
Y

5
Implementation of MUX with Enable Input
Most of the Digital Blocks have an enable input to control the operation of the unit.

Enable could be active High or active Low.

6
Implementation of MUX with Enable Input
active Low Enable:

 When enable input active (applied 0 on that line for active Low Enable): circuit functions as a
normal multiplexer
 When enable input inactive (applied 1 on that line for active Low Enable) : outputs are disabled

7
Implementation of 4x1 MUX

+
8
Quadruple 2-to-1-line Multiplexer

 The outputs have all 0’s when E = 1,


regardless of the value of S .
 Unit is enabled when E = 0.
 S = 0, the four A inputs have a path to the
four outputs.
 S = 1, four B inputs have a path to the four
outputs.

9
Boolean Function Implementation using MUX
The individual minterms can be selected by the data inputs, thereby providing a method of
implementing a Boolean function of n-variables with a multiplexer that has n-selection
inputs and 2n data inputs, one for each minterm.

Implementation Method:

Case 1: For implementing a Boolean function of n-variables with a multiplexer that


has n-selection lines.

Case 2: For implementing a Boolean function of n-variables with a multiplexer that has
n – 1 selection lines.

Case 3: For implementing a Boolean function of n-variables with a multiplexer that has
n – 2 selection lines.

10
Case-1 Example: Boolean Function Implementation using 8x1 MUX
F(A, B, C) = ∑ m(2, 3, 6, 7)

11
Case-2 Example: Boolean Function Implementation 4x1 using MUX

12
Case-2 Example: Boolean Function Implementation using 8x1 MUX

13
Case-3 Example: Boolean Function Implementation using 4x1 MUX

𝑪D

𝑪+D
𝑪
𝑪D

S1 S0 Y
0 0 I0 = 𝑪D
Let we tie
0 1 I1= 𝑪+D S0 = B
1 0 I2 = 𝑪D S1 = A
1 1 I3 = 𝑪
14
De-Multiplexer
A De-multiplexer is a combinational circuit that has only 1 input line and 2N output lines.

1×2 De-multiplexer:
In the 1 to 2 De-multiplexer, there are only two outputs, i.e., Y0, and Y1, 1 selection lines, i.e., S0, and single input,
i.e., A. On the basis of the selection value, the input will be connected to one of the outputs.

The logical expression of the term Y is as follows:

Y0=S0’.A
Y1=S0.A 15
1×4 De-multiplexer
In 1 to 4 De-multiplexer, there are total of four outputs, i.e., Y0, Y1, Y2, and Y3, 2 selection
lines, i.e., S0 and S1 and single input, i.e., A.

The logical expression of the term Y is as follows:


Y0=S1' S0’ A
y1=S1' S0 A
y2=S1 S0’ A
y3=S1 S0 A
Thank you !!!

You might also like