Multiplexers Next, we’ll study multiplexers, which are just as commonly used as the decoders we presented last time. Again, These serve as examples for.

Slides:



Advertisements
Similar presentations
Part 4: combinational devices
Advertisements

Multiplexers Today, we’ll study multiplexers, which are just as commonly used as the decoders we presented last time. Again, These serve as examples for.
Give qualifications of instructors: DAP
Princess Sumaya University
Modular Combinational Logic
Combinational Circuits
Functions and Functional Blocks
Prof. Sin-Min Lee Department of Computer Science
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
EE2174: Digital Logic and Lab
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Decoders, Multiplexers and Programmable Logic. MSI and PLD components1 Decoders Next, we’ll look at some commonly used circuits: decoders and multiplexers.
Combinational and Sequential Logic Circuits.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Lecture 23 Final Revision 3. Prof. Sin-Min Lee.
CS1Q Computer Systems Lecture 8
WEEK #9 FUNCTIONS OF COMBINATIONAL LOGIC (DECODERS & MUX EXPANSION)
IKI c-Decoders, Selectors, etc. Bobby Nazief Semester-I The materials on these slides are adopted from: CS231’s Lecture Notes at UIUC,
Digital Logic Problems (II) Prof. Sin-Min Lee Department of Mathematics and Computer Science.
Combinational Design, Part 3: Functional Blocks
February 2, 2004CS 2311 Karnaugh maps Last time we saw applications of Boolean logic to circuit design. – The basic Boolean operations are AND, OR and.
Hamming Code,Decoders and D,T-flip flops Prof. Sin-Min Lee Department of Computer Science.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 7 Dr. Shi Dept. of Electrical and Computer Engineering.
CS231 Boolean Algebra1 Summary so far So far: – A bunch of Boolean algebra trickery for simplifying expressions and circuits – The algebra guarantees us.
CS1Q Computer Systems Lecture 8
Multiplexors Decoders  Decoders are used for forming separate signals for different combination of input signals.  The multiplexer circuit is a digital.
Addition and multiplication Arithmetic is the most basic thing you can do with a computer, but it’s not as easy as you might expect! These next few lectures.
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
1 DLD Lecture 16 More Multiplexers, Encoders and Decoders.
Combinational Logic Decoders, Encoders, Multiplexers 03.
Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.
Gunjeet kaur Dronacharya Group of Institutions. Demultiplexers.
Prof. Sin-Min Lee Department of Computer Science
Prof. Sin-Min Lee Department of Computer Science
Reference: Chapter 3 Moris Mano 4th Edition
CS221: Digital Logic Design Combinational Circuits 3
Reference: Chapter 3 Moris Mano 4th Edition
Multiplexers and Demultiplexers,
Combinational Functions and Circuits
Combinational Logic Circuits
Circuit analysis summary
Lecture 4: Combinational Functions and Circuits
Reference: Chapter 3 Moris Mano 4th Edition
Basics of Digital Logic Design Presentation D
EEL 3705 / 3705L Digital Logic Design
Basics Combinational Circuits Sequential Circuits
Additional Gates and Decoders
Week 7: Gates and Circuits: PART II
Programmable Configurations
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Digital Logic.
COE 202: Digital Logic Design Combinational Circuits Part 3
Dr. Clincy Professor of CS
Recall: ROM example Here are three functions, V2V1V0, implemented with an 8 x 3 ROM. Blue crosses (X) indicate connections between decoder outputs and.
Design example: Comparing 2-bit numbers
From now on: Combinatorial Circuits:
Logic Circuits I Lecture 3.
Chapter-4 Combinational Logic
ECE 352 Digital System Fundamentals
ECE 352 Digital System Fundamentals
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.
Sequential circuit analysis
Digital System Design Combinational Logic
Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can.
ECE 352 Digital System Fundamentals
Presentation transcript:

Multiplexers Next, 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. 5/6/2019 Multiplexers

Why multiplexers are needed Imagine that you have sensors around a building: Some (say 5) sensing temperature, some (say 3) wind velocity They need to connect to the computer, so it can read them Each sensor produces (say) a 8 bit value Problem: the computer has only 8 wires on which it can read input 5/6/2019 Multiplexers

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: 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). Q = S’ D0 + S D1 5/6/2019 Multiplexers

More truth table abbreviations Here is a full truth table for this 2-to-1 mux, based on the equation: Here is another kind of abbreviated truth table. Input variables appear in the output column. This table implies that when S=0, the output Q=D0, and when S=1 the output Q=D1. This is a pretty close match to the equation. Q = S’ D0 + S D1 5/6/2019 Multiplexers

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. Q = S1’ S0’ D0 + S1’ S0 D1 + S1 S0’ D2 + S1 S0 D3 5/6/2019 Multiplexers

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). 5/6/2019 Multiplexers

A more efficient way We can actually implement f(x,y,z) = m(1,2,6,7) with just a 4-to-1 mux, instead of an 8-to-1. Step 1: Find the truth table for the function, and group the rows into pairs. Within each pair of rows, x and y are the same, so f is a function of z only. When xy=00, f=z When xy=01, f=z’ When xy=10, f=0 When xy=11, f=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. 5/6/2019 Multiplexers

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. With S1=X and S0=Y, then Q=X’Y’D0 + X’YD1 + XY’D2 + XYD3 Equation for the multiplexer 5/6/2019 Multiplexers

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. When XY=00, C=0 When XY=01, C=Z When XY=10, C=Z When XY=11, C=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) 5/6/2019 Multiplexers

Multiplexer-based sum Here’s the same thing, but for the sum function S(X,Y,Z). When XY=00, S=Z When XY=01, S=Z’ When XY=10, S=Z’ When XY=11, S=Z 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) 5/6/2019 Multiplexers

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.” 5/6/2019 Multiplexers

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 5/6/2019 Multiplexers

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. 5/6/2019 Multiplexers