CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.

Slides:



Advertisements
Similar presentations
Part 4: combinational devices
Advertisements

Digital Design: Combinational Logic Blocks
Modular Combinational Logic
Combinational Circuits
Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
©2004 Brooks/Cole FIGURES FOR CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES Click the mouse to move to the next page. Use the ESC key.
CPEN Digital System Design
Multiplexers, Decoders, and Programmable Logic Devices

ECE 331 – Digital System Design Tristate Buffers, Read-Only Memories and Programmable Logic Devices (Lecture #16) The slides included herein were taken.
Multiplexer MUX. 2 Multiplexer Multiplexer (Selector)  2 n data inputs,  n control inputs,  1 output  Used to connect 2 n points to a single point.
Chapter2 Digital Components Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Logic Gates Combinational Circuits
Figure to-1 Multiplexer and Switch Analog
Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Combinational Logic Design
Combinational and Sequential Logic Circuits.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Combinational Circuit – Arithmetic Circuit
ECE 3130 – Digital Electronics and Design
Documentation Standards Circuit specification. –Description of what the system is supposed to do, including a description of all inputs and outputs and.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
WEEK #9 FUNCTIONS OF COMBINATIONAL LOGIC (DECODERS & MUX EXPANSION)
1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)
Digital Logic Problems (II) Prof. Sin-Min Lee Department of Mathematics and Computer Science.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
Chapter 5 Designing Combinational Systems Tell me what you Have in Have out And want done in between Then I can build a program to do anything. Capt. Ed.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
Programmable Logic Devices (PLDs)
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Friday, February 14 CEC 220 Digital Circuit Design Slide 1 of 18.
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
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
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
Designing Combinational Systems
Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.
CSE 370 Spring 2006 Introduction to Digital Design Lecture 10: Multiplexers and Demultiplexers Last Lecture Multilevel Logic Hazards Today Multiplexers.
Complex Combinational Circuits Binary Adders Key to enterprise: Addition table also a truth table S i = C i 'A i B i ' + C i 'A i 'B i + C i A i 'B i '+
CSI-2111 Structure of Computers Ipage Combinational Circuits  Objectives : To recognize the principal types of combinational circuits  Adders.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Multiplexers.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,
Programmable Logic Devices
This chapter in the book includes: Objectives Study Guide
ECE 3130 Digital Electronics and Design
Logic Devices. Decoder 2-to-4 Decoder 3-to-8 Decoder.
Part 4 Combinational Logic.
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Combinational Circuit Design
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Dr. Clincy Professor of CS
This chapter in the book includes: Objectives Study Guide
Magnitude Comparator A magnitude comparator is a combinational circuit that compares two numbers, A and B, and then determines their relative magnitudes.
Dr. Clincy Professor of CS
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Programmable Configurations
Lecture 10 Logistics Last lecture Today
Dr. Clincy Professor of CS
Lecture 11 Logistics Last lecture Today HW3 due now
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Overview Last lecture Timing; Hazards/glitches
Digital System Design Combinational Logic
Presentation transcript:

CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina

Chapter 5: Designing Combinational Systems

10/13/20093 Iterative System A system implemented with multiple copies of a smaller circuit Consider 4-bit adder as an example

10/13/20094 Delay in Combinational Logic Circuits When the input to a gate changes, the output of that gate will not change instantaneously Instead, there is a small delay ∆ If the output of one gate is used as the input to another gate, the delays will add The output is stable after the longest delay path

10/13/20095 Delay in Combinational Logic Circuits Hazard (or glitch)

10/13/20096 Example of Delay

10/13/20097 Cascading 4-bit Adders Can cascade multiple 4-bit adders if larger adders are needed

10/13/20098 Subtractors and Add/Subtractors To do subtraction, we can develop a 1-bit full subtractor and cascade as many of them as necessary On the other hand, we can build an add/subtractor based on an adder because a – b = a + (-b) Will need a signal line which is 0 for addition and 1 for subtraction (called a’/s, i.e. add’/subtract) This is because 1  x = x’ and 0  x = x

10/13/20099 Subtractors and Add/Subtractors

10/13/ Binary Decoder A binary decoder is a device that, when activated, selects one of several output lines, based on a coded input signal The input is an n-bit binary number, and there are 2 n output lines Some decoders also have one or more enable inputs Often used to select one of many devices

10/13/ Active High Decoder

10/13/ Active Low Decoder

10/13/ Decoder with Enable

10/13/ Decoder

10/13/ Decoder

10/13/ Use Decoder to Enable Another Decoder

10/13/ Multiplexers A multiplexer is a switch that passes one of its data inputs through to the output, as a function of a set of select inputs Sets of multiplexers are often used to choose among several multibit input numbers

10/13/ Two-way Multiplexer out = w if S = 0; out = x if S = 1

10/13/ Four-way Multiplexer

10/13/200920

10/13/ Three-variable Function Implemented with Multiplexer

10/13/ Demultiplexer Inverse of a mux: routes a signal from one place to one of many places

10/13/ Three-State Gates Has an enable input If the enable input is active, the gate behaves as usual If the enable input is inactive, the output behaves as if it is not connected

10/13/ A Multiplexer using Three- State Gates if EN = 0, f = a if EN = 1, f = b

10/13/ Gate Arrays Also known as programmable logic device (PLD) or field programmable gate array (FPGA) An efficient way of implementing complicated systems Can implement SOP expressions which are sums of some common product terms

10/13/ Structure of a Gate Array

10/13/ An Example of Gate Array f = a’b’ + abc g = a’b’c’ + ab + bc h = a’b’ + c

10/13/ Three Types of Combinational Logic Arrays Programmable Logic Array (PLA) User specifies all of the connections in both the AND array and the OR array Read-Only Memory (ROM) The AND array is fixed – like a decoder consisting of 2 n AND gates for n inputs User specifies the connections in the OR array Programmable Array Logic (PAL) The connections to the OR gates are specified; user determines the AND gate inputs

10/13/ Only need a list of minterms for each function. For example, W(A, B, C, D) = ∑m(3, 7, 8, 9, 11, 15) X(A, B, C, D) = ∑m(3, 4, 5, 7, 10, 14, 15) Y(A, B, C, D) = ∑m(1, 5, 7, 11, 15) Design with Read-Only Memories

10/13/ Structure of a PAL