ECE 171 Digital Circuits Chapter 10 MUX Herbert G. Mayer, PSU Status 11/23/2015 Copied with Permission from prof. Mark PSU ECE.

Slides:



Advertisements
Similar presentations
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Advertisements

Overview Part 1 – Gate Circuits and Boolean Equations
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
Exclusive-OR and Exclusive-NOR Gates
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
Encoders Three-state devices Multiplexers
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Combinational Logic and Verilog. XORs and XNORs XOR.
CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits.
1 Buffers Buffer:  Doesn’t change the input.  Only amplifies. in out EN.
Parity. 2 Datasheets TTL:  CMOS: 
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
Parity. 2 Datasheets TTL:  CMOS: 
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
5.8 Exclusive-OR Gates and Parity Circuits ReturnNext Exclusive-OR(XOR) Gates Exclusive-NOR(XNOR) Gates x ⊕ y=x · y+x · y x ⊙ y=x · y+x · y
1 EE365 Three-state Outputs Encoders Multiplexers XOR gates.
Combinational Logic Building Blocks
EE365 Adv. Digital Circuit Design Clarkson University Lecture #8 Buffers, Drivers, Encoders, MUXs & XORs.
Multiplexers DeMultiplexers XOR gates
Lab 04 :Serial Data Control Systems : Slide 2 Slide 3 Slide 4 NOR Gate: NAND Gate: NOR / NAND Alternate Symbols: Slide 5 XOR and XNOR Gate: Serial Data.
Chapter 4 Register Transfer and Microoperations
Adders, subtractors, ALUs
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 10 – Other Gate Types.
Additional Gates BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Combinational Logic Design
Encoders Three-state Outputs Multiplexers XOR gates.
Chap 9 supplement MUX/DMUX C H 1 Lecture 9B MUX/DMUX Tree One application example of MUX/DMUX –One data line + 3 selection line (GND not shown) –Time-multiplexed.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Three-state devices Multiplexers
Documentation Standards Circuit specification. –Description of what the system is supposed to do, including a description of all inputs and outputs and.
Fall 2004EE 3563 Digital Systems Design EE3563 Multiplexers  A multiplexer is a digital switch  Allows a device to select a single line from many  Some.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 7 Transformations Factoring - finding a factored form from SOP or POS expression Decomposition.
CS 151: Introduction to Digital Design Chapter 2-9 Exclusive-OR Gates.
Multiplexers XOR gates. Multiplexers A multiplexer is a digital switch - it connects data from one of n sources to its output. An n-input and b-bit multiplexer.
Kuliah Rangkaian Digital Kuliah 6: Blok Pembangun Logika Kombinasional Teknik Komputer Universitas Gunadarma.
1 EE121 John Wakerly Lecture #6 Three-state Outputs Encoders Multiplexers XOR gates.
1 Building Larger Circuits Today: Combinational Building BlocksFirst Hour: Combinational Building Blocks –Section 4.1 of Katz’s Textbook –In-class Activity.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
LOGIC CIRCUIT IMPLEMENTATION
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices X-OR gates and Parity circuits Comparators Adders, subtractors,
1 CS 151: Introduction to Digital Design Chapter 2-10 High Impedance Outputs.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Three-state devices Multiplexers.
1 Outline Bus Transfer Memory Transfer Microoperations.
Digital Electronics Chapter 3 Gate-Level Minimization.
1 COMP541 Combinational Logic - 3 Montek Singh Jan 23, 2012.
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Chapter # 4: Programmable Logic
Copied with Permission from prof. Mark PSU ECE
ECE 171 Digital Circuits Chapter 6 Logic Circuits Herbert G. Mayer, PSU Status 1/16/2016 Copied with Permission from prof. Mark PSU ECE.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Multiplexers.
Combinational Logic: Other Gate Types
ECE 171 Digital Circuits Chapter 9 Hazards Herbert G. Mayer, PSU Status 2/21/2016 Copied with Permission from prof. Mark PSU ECE.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.
Combinational Logic Design
1 Digital Systems Design Lecture 7 Transformations Factoring - finding a factored form from SOP or POS expression Decomposition - expression of a function.
Lecture 11 Topics Additional Design Techniques Distributed Connections
Lecture 6 Topics Combinational Logic Circuits
2-6 Exclusive-OR Operator and Gates
Overview Part 1 – Gate Circuits and Boolean Equations
Buffers Buffer: Doesn’t change the input. Only amplifies. EN in out.
EET107/3 DIGITAL ELECTRONICS 1
King Fahd University of Petroleum and Minerals
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
XOR Function Logic Symbol  Description  Truth Table 
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

ECE 171 Digital Circuits Chapter 10 MUX Herbert G. Mayer, PSU Status 11/23/2015 Copied with Permission from prof. Mark PSU ECE

Syllabus Open Collector Wired Drain Wired AND References

Lecture 11 Topics –Additional Design Techniques Distributed Connections –Open Collector, Open Drain –Dot AND Three State Outputs More on MUXs and Decoders/DMUXs More on XOR and XNOR 3

TTL Open Collector Outputs 4

CMOS Open Drain Outputs 5

Wired AND (Dot AND) 6

Wired AND Examples 7

A Design Example 8

9

Using Open Drain Gate to Drive LEDs 10 Connect to open drain output

Three-State Outputs and the Disconnect State TTL CMOS Floating Output High Impedance Tri-State® (National Semiconductor) 11

Tri-State® Buffers 74LS126A Bus Buffer OE F 0 Z 1 A 74LS125A Bus Buffer OE F 0 B 1 Z 12

Data Bus Sharing 13

Bus Buffers 14

More About MUXs and Decoders/DMUXs 15

Off-the-shelf MUXs 16

MUX Trees Determine number of select inputs needed 2 n = 4, n = 2 List inputs and output in truth table order A B F Annotate with the bit weights 2 1 A B F Reverse the order 2 1 A B F 1 2 Circled numbers indicate number of 2-to-1 muxs A 4-to-1 MUX using 2-to-1 MUXs 17

Generalizing… Determine number of select inputs needed 2 n = 16, n = 4 List inputs and output in truth table order A B C D F Annotate with the bit weights A B C D F Reverse the order A B C D F Circled numbers indicate number of 2-to-1 muxs and 8-to-1 muxs A 16-to-1 MUX using 8-to-1 MUXs 18

Generalizing… Determine number of select inputs needed 2 n = 64, n = 6 List inputs and output in truth table order U V W X Y Z F Annotate with the bit weights U V W X Y Z F Reverse the order U V W X Y Z F Circled numbers indicate number of 4-to-1 muxs A 64-to-1 MUX using 4-to-1 MUXs 19

20

DMUXs 21

Larger DMUXs 2-to-43-to-84-to-16 Off-the-shelf devices use active L EN Outputs also active L 3-to-8 DMUX == “1 of 8 DMUX” 1-to-2 DMUX unavailable logic gates use 2-to-4 dmux 22

DMUX Trees Determine number of address inputs needed 2 n = 4, n = 2 List inputs and output in truth table order A B D0 D1 D2 D3 Annotate with the bit weights 2 1 A B D0 D1 D2 D3 Reverse the order 2 1 A B D0 D1 D2 D3 1 2 Circled numbers indicate number of 1-to-2 dmuxs A 1-to-4 DMUX using 1-to-2 DMUXs 23

DMUX Trees Determine number of address inputs 2 4 = 16, n = 4 List I/Os in truth table order A B C D D0 … D15 Annotate with the bit weights A B C D D0 … D15 Reverse the order A B C D D0 … D Circled numbers indicate number of 3-to-8 and 1-to-2 dmuxs respectively A 4-to16 DMUX 24

More on XOR and XNOR Distinctive K-Map patterns indicative of XOR and XNOR 25

More on XOR and XNOR Equivalent XOR Symbols Even number of bubbles rule Equivalent XNOR Symbols Odd number of bubbles rule 26

The Odd Function XOR 27

The Even Functions XNOR 28

Parity A single bit error detection scheme Even parity: generate and transmit odd function – checker will use odd function to detect parity error Odd parity: generate and transmit even function – checker will use even function to detect parity error 29

Parity A single bit error detection scheme Even parity: generate and transmit odd function – checker will use odd function to detect parity error

Comparators 31

Comparators Non-expandable 4-bit comparator requires external logic to construct an 8-bit comparator 32

Comparators Expandable 4-bit comparator doesn’t require external logic to construct an 8-bit comparator – can accept inputs from other “stage” 33