ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Programmable Logic Devices.

Slides:



Advertisements
Similar presentations
Limitations are  The number of inputs (n)  The number of outputs (m)  The number of product terms (p) 5.3 Combinational PLDs ReturnNext Programmable.
Advertisements

Overview Programmable Implementation Technologies (section 6.8)
Documentation Standards
CS370 – Spring 2003 Programmable Logic Devices PALs/PLAs.
Programmable Logic PAL, PLA.
Programmable Logic Devices
1 Programmable Logic. 2 Prgrammable Logic Organization Pre-fabricated building block of many AND/OR gates (or NOR, NAND) "Personalized" by making or breaking.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Programmable Logic Devices
Digital Logic Design Lecture 21. Announcements Homework 7 due on Thursday, 11/13 Recitation quiz on Monday on material from Lectures 21,22.
CSET 4650 Field Programmable Logic Devices Dan Solarek Introduction to PALs Programmable Array Logic.
BR 1/991 Programmable Logic There has to be a better way to implement a logic function than to hook together discrete 74XX packages or create a custom.
Documentation Standards Programmable Logic Devices Decoders
EE365 Adv. Digital Circuit Design Clarkson University Lecture #7 Intro to MSI PLDs and Decoders.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.

Chapter # 4: Programmable and Steering Logic Section 4.1
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
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.
ENEE x Digital Logic Design Lecture 20. Announcements Homework 6 due today. Homework 7 up on course webpage, due on 11/13. Recitation quiz on Monday,
PLAs Programmable Logic Arrays
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.
Programmable Array Logic (PAL) Fixed OR array programmable AND array Fixed OR array programmable AND array Easy to program Easy to program Poor flexibility.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 13 – Programmable.
Figure to-1 Multiplexer and Switch Analog
Chapter 4 Programmable Logic Devices: CPLDs with VHDL Design Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights.
Programmable logic devices
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
1/2550A. Yaicharoen1 Programmable Logic Devices. 1/2550A. Yaicharoen2 General structure of PLDs.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
Field-programmable logic devices FPLA circuits –Packaged PLA components with a fuse at every diode in both the AND and OR sections, that can be configured.
Memory and Programmable Logic Memory device: Device to which binary information is transferred for storage, and from which information is available for.
Programmable Logic Devices
1 Lecture #10 EGR 277 – Digital Logic Multiplexers (Data Selectors) A multiplexer (MUX) is a device that allows several low-speed signals to be sent over.
1 Lecture 9 Demultiplexers Programmable Logic Devices  Programmable logic array (PLA)  Programmable array logic (PAL)
Chapter 4 Programmable Logic Devices: CPLDs with VHDL Design Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights.
Chapter
0/13 Introduction to Programmable Logic Devices Aleksandra Kovacevic Veljko Milutinovic
1 Memory Design EE 208 – Logic Design Chapter 7 Sohaib Majzoub.
Logical Circuits Philip Gebhardt 3/15/2011. Logic Circuits Negative, Positive, and Complimentary circuits Logic Gates Programmable Logic Devices.
1 CSE370, Lecture 10 Lecture 10 u Logistics n HW3 due Friday (cover materials up to this lecture) n Lab3 going on this week n Midterm 1: a week from today.
Programmable Logic Devices - I. Outline  Programmable Logic Devices  PN Diode Operation  AND Logic Arrays  OR Logic Arrays  Two-level AND-OR Arrays.
Programmable Logic Devices (PLDs)
EE207: Digital Systems I, Semester I 2003/2004
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 8: Documentation and Timing Diagrams José Nelson Amaral.
ECE 171 Digital Circuits Chapter 10 Programmable Logic Devices (PLD)
1 EE121 John Wakerly Lecture #5 Documentation Standards Programmable Logic Devices Decoders.
DIGITAL SYSTEMS Programmable devices PLA-PAL Rudolf Tracht and A.J. Han Vinck.
CSET 4650 Field Programmable Logic Devices
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.
Programmable Logic Devices. Principle of Operation: Example: X = A.B + A’.B’ requires that fuses f1 and f4 to be “blown”.
ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Programmable Logic Devices.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Programmable Logic Devices
Gunjeet Kaur Dronacharya Group of Institutions. Outline Introduction Random-Access Memory Memory Decoding Error Detection and Correction Programmable.
Programmable Logic Devices
 Seattle Pacific University EE Logic System DesignProgrammable-1 Implementing Sums-of-Products Z A B C D E F We find And-Or structures like this.
1 Programmable Logic There are other ways to implement a logic function than to hook together discrete 74XX packages or create a custom Integrated Circuit.
This chapter in the book includes: Objectives Study Guide
Programmable Logic Devices
Logic and Computer Design Fundamentals
This chapter in the book includes: Objectives Study Guide
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Programmable Logic Arrays, Test Review
PROGRAMMABLE LOGIC DEVICES (PLD) UNIT-IV
Presentation transcript:

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Programmable Logic Devices

Programmable Logic Devices (PLDs) PLDs can implement wide functions efficiently (functions with many input variables). PLDs can implement multiple functions of different variables efficiently. The logic in PLDs is programmable -- it can be defined by the user and programmed on the desktop  Most PLDs can be erased and reprogrammed many times.

PLD types There are MANY different types of PLDs. Densities ranges from from 10’s of gates to 100’s of thousands of gates. We will look at PLAs (Programmable Logic Arrays) and PALs (Programmable Array Logic devices).

Programmable Logic Arrays (PLAs) Any combinational logic function can be realized as a sum of products. Idea: Build a large AND-OR array with lots of inputs and product terms, and programmable connections.  n variables AND gates have 2n inputs -- true and complement of each variable.  m outputs, driven by large OR gates Programmable connection between Each AND gate to any output OR gate.  p AND gates (p<<2 n )

Example: 4x3 PLA, 6 product terms

Compact representation Actually, closer to physical layout (“wired logic”).

Some product terms

PLA Electrical Design See Section wired-AND logic

Programmable Array Logic (PALs) PLAs  Both AND and OR arrays are programmable  Product terms can be shared by OR gates PALs ==> fixed OR array  Each AND gate is permanently connected to a certain OR gate.  AND arrays are programmable, while OR arrays are not.  Product terms cannot be shared by OR gates

10 primary inputs 8 outputs, with 7 ANDs per output 1 AND for 3-state enable 6 outputs available as inputs  more inputs, at expense of outputs  two-pass logic, helper terms Note inversion on outputs  output is complement of sum-of-products  newer PALs have selectable inversion

DJ P Understanding the Diagram Horizontal lines indicate a product term. Vertical lines provide True and Complemented forms of external inputs. Even though a product term looks like it has only one input, it actually has 2 * N inputs, where N is the number of external inputs.

Product Term This looks like an AND gate with one input. Is actually: B B’A A’ C C’ D D’I I’ J J’ E E’ F F’ K K’GG’H H’ B B’ A A’ C C’ H’ H Only drawn with a single line to save space.

DJ P Fuse Points A cross over of a Vertical input line and a horizontal product term line is a FUSE LOCATION. When the PAL is in its blank or erased state, all FUSES are connected. This means that each product term implements the equation: ( A A’ B B’ C C’……. KK’) will be ‘0’! This means that the output will be high!

DJ P PAL Programming To program, will want to BLOW most of the fuses (break the vertical/horizontal crossover connection). To indicate a logic function, will use a ‘ X ‘ over a fuse that I want to KEEP INTACT. Will mark Intact fuse location. When a fuse is blown, that product term input acts as a ‘1’ so that the input no longer effects the product term.

DJ P P’ = D + J’ When implementing an equation, sometimes will not want to use all available product terms. If ALL fuses along product term are left intact, then product term value will be ‘0’ and will not affect equation. Mark unused PT’s by placing an X over them. Note that P’ must be implemented!

Example Product Term AC’H’ The connections will be: B B’A A’ C C’ D D’I I’ J J’ E E’ F F’ K K’GG’H H’ 1 1 A 1 1 C’ H’ 1 Fuse blown Fuse intact Fuse blown Fuse intact Fuse blown Fuse intact Actually, fuses are not ‘blown’ in erasable PLDs - the connection is broken in a non-destructive way for erasable PLDs.

Another Example A B C D G H I J P P’ = A’BGH’ + CD’ + HIJ + BG’H

10 primary inputs 8 outputs, with 7 ANDs per output 1 AND for 3-state enable 6 outputs available as inputs  more inputs, at expense of outputs  two-pass logic, helper terms Note inversion on outputs  output is complement of sum-of-products  newer PALs have selectable inversion