Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.

Презентация:



Advertisements
Похожие презентации
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 2 – Sequential.
Advertisements

Lecture # Computer Architecture Computer Architecture = ISA + MO ISA stands for instruction set architecture is a logical view of computer system.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v Route Selection Using Policy Controls Applying Route-Maps as BGP Filters.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 2 –
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
Loader Design Options Linkage Editors Dynamic Linking Bootstrap Loaders.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v Customer-to-Provider Connectivity with BGP Connecting a Multihomed Customer to Multiple Service.
Designing Network Management Services © 2004 Cisco Systems, Inc. All rights reserved. Designing the Network Management Architecture ARCH v
Yogesh Mehla Now concept of logic building is not so complex and not so simple. We will not work on how to make logic program in.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v Complex MPLS VPNs Using Advanced VRF Import and Export Features.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v Optimizing BGP Scalability Implementing BGP Peer Groups.
HPC Pipelining Parallelism is achieved by starting to execute one instruction before the previous one is finished. The simplest kind overlaps the execution.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v Customer-to-Provider Connectivity with BGP Understanding Customer-to-Provider Connectivity.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v Route Selection Using Policy Controls Employing AS-Path Filters.
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
© 2009 Avaya Inc. All rights reserved.1 Chapter Two, Voic Pro Components Module Two – Actions, Variables & Conditions.
© 2005 Cisco Systems, Inc. All rights reserved.INTRO v Managing Your Network Environment Managing Router Startup and Configuration.
© 2005 Cisco Systems, Inc. All rights reserved.INTRO v Managing Your Network Environment Managing Cisco Devices.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v BGP Transit Autonomous Systems Configuring a Transit AS.
Транксрипт:

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable Implementation Technologies Logic and Computer Design Fundamentals

Chapter 6 - Part 4 2 Overview Programmable Implementation Technologies (section 6.8) Why Programmable Logic? Read-Only Memories (ROMs) Programmable Logic Arrays (PLAs) Programmable Array Logic (PALs)

Chapter 6 - Part 4 3 Why Programmable Logic? Small and Medium Scale Integration Up to 200 gates per device/IC Most common is 74xx series (gates, FF, Decoders …) Advantages Easy to understand functions Exceptional Signal Visibility Disadvantages Low logic density means big boards or small designs Higher power consumption Failure concern per function

Chapter 6 - Part 4 4 Why Programmable Logic? Large Scale Integration Ranging from 200 to 200,000 gates per device. Small memories, programmable logic devices Advantages Higher logic density means smaller boards or larger designs. Many devices can be programmed and reprogrammed, saving expense when changes are made. Disadvantages Need to learn how to use and program Signal visibility is reduced

Chapter 6 - Part 4 5 Why Programmable Logic ? Many programmable logic devices are field- programmable, i. e., can be programmed outside of the manufacturing environment Most programmable logic devices are erasable and reprogrammable. Allows updating a device or correction of errors Allows reuse the device for a different design - the ultimate in re-usability! Ideal for course laboratories

Chapter 6 - Part 4 6 Programmable Configurations Read Only Memory (ROM) - a fixed array of AND gates and a programmable array of OR gates Programmable Array Logic (PAL) - a programmable array of AND gates feeding a fixed array of OR gates. Programmable Logic Array (PLA) - a programmable array of AND gates feeding a programmable array of OR gates. PAL is a registered trademark of Lattice Semiconductor Corp.

7 Gate Symbols Figure 6-18 Conventional and Array Logic Symbols for OR Gate

Chapter 6 - Part 4 8 Read Only Memory Read Only Memories (ROM) or Programmable Read Only Memories (PROM) are OP logic devices with a fixed AND array and a programmable OR array. have: k input lines, m output lines, and m = 2 k decoded minterms n OR gates Usually referred as 2 k x n ROM Can implement n functions with k inputs k-to-2 k line decoder D7 D6 D5 D4 D3 D2 D1 D0 A2 A1 A0 A B C F0 F1F2 F3 X X X X X X X X X X

Chapter 6 - Part 4 9 Read Only Memory A program for a ROM or PROM is simply a multiple- output truth table If a 1 entry, a connection is made to the corresponding minterm for the corresponding output If a 0, no connection is made There is no advantage of simplifying the function when using ROM since we need to specify the entire list of minterms. Can be viewed as a memory with the inputs as addresses of data (output values), hence ROM or PROM names!

Example: A 8 X 4 ROM (N = 3 input lines, M= 4 output lines) The fixed "AND" array is a decoder with 3 inputs and 8 outputs implementing minterms. The programmable "OR array uses a single line to represent all inputs to an OR gate. An X in the array corresponds to attaching the minterm to the OR Read Example: For input (A 2,A 1,A 0 ) = 001, output is (F 3,F 2,F 1,F 0 ) = What are the simplified expressions for F 3, F 2, F 1 and F 0 in terms of (A 2, A 1, A 0 )? Chapter 6 - Part 4 10 Read Only Memory Example D7 D6 D5 D4 D3 D2 D1 D0 A2 A1 A0 A B C F0 F1F2 F3 X X X X X X X X X X

Chapter 6 - Part 4 11 P rogrammable Array Logic (PAL ) PAL is the opposite of ROM; it is PLD that has a programmable AND array and a fixed OR array. Function has to be reduced into SOP before it is programmed into the PAL Disadvantage ROM guaranteed to implement any M functions of N inputs. PAL may have too few inputs to the OR gates. Advantages For given internal complexity, a PAL can have larger k (inputs) and n (outputs) Some PALs have outputs that can be complemented, adding POS functions

12 Figure

Chapter 6 - Part 4 13 P rogrammable Logic Array (PLA ) Compared to a ROM and a PAL, a PLA is the most flexible having a programmable set of ANDs combined with a programmable set of ORs. A PLA has all of its product terms connectable to all outputs, overcoming the problem of the limited inputs to the PAL OR gates Some PLAs have outputs that can be complemented (using XOR gates), adding POS functions

Chapter 6 - Part 4 14 Programmable Array Logic (PLA) The PAL is the opposite of the ROM, having a programmable set of ANDs combined with fixed ORs. Fuse intact Fuse blown 1 F 1 F 2 X A B C CCBBAA X X X X X X X X X X X X X X A B A C B C A B X 3-input, 3-output PLA with 4 product terms Used to produce POS or complement of function

Chapter 6 - Part 4 15 ROM, PAL and PLA Summary (a) Programmable read-only memory (PROM) Inputs Fixed AND array (decoder) Programmable OR array Outputs Programmable Connections (b) Programmable array logic (PAL) device Inputs Programmable AND array Fixed OR array Outputs Programmable Connections (c) Programmable logic array (PLA) device Inputs Programmable OR array Outputs Programmable Connections Programmable Connections Programmable AND array