ENGIN112 L31: Read Only Memory November 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 31 Read Only Memory (ROM)

Slides:



Advertisements
Similar presentations
ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.
Advertisements

Give qualifications of instructors: DAP
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
Overview Programmable Implementation Technologies (section 6.8)
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
CPEN Digital System Design
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
ENGIN112 L28: Timing Analysis November 7, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 28 Timing Analysis.
Parity. 2 Datasheets TTL:  CMOS: 
Chapter 6 – Selected Design Topics Part 4 – Programmable Implementation Technologies Logic and Computer Design Fundamentals.
Memory and Programmable Logic
Overview Memory definitions Random Access Memory (RAM)
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Overview Recall Combinational Logic Sequential Logic Storage Devices

Give qualifications of instructors: DAP
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
ENGIN112 L33: Arithmetic Logic Units November 21, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 33 Arithmetic Logic Unit (ALU)
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.
CS 151 Digital Systems Design Lecture 31 Read Only Memory (ROM)
Sequential circuits part 2: implementation, analysis & design All illustrations  , Jones & Bartlett Publishers LLC, (
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 13 – Programmable.
Random-Access Memory (RAM)
Chapter 5 Memory and Programmable Logic 5.1. Introduction 5.2. Random Access Memory 5.3. Memory Encoding 5.4. Read Only Memory 5.5. Programmable Logic.
Memory and Programmable Logic Dr. Ashraf Armoush © 2010 Dr. Ashraf Armoush.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
1 Lecture 32 Datapath Analysis. 2 Overview °Datapaths must deal with input and output data values Implement with tri-state buffers °Necessary to control.
Logic and Computer Design Dr. Sanjay P. Ahuja, Ph.D. FIS Distinguished Professor of CIS ( ) School of Computing, UNF.
Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.
CSET 4650 Field Programmable Logic Devices
Memory and Programmable Logic Memory device: Device to which binary information is transferred for storage, and from which information is available for.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /10/2013 Lecture 5: Combinational Logic Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE.
ROM & PLA Digital Logic And Computer Design
Lecture 30 Read Only Memory (ROM)
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
Princess Sumaya University
1 CSE370, Lecture 11 Lecture 11  Logistics  HW3 due now  Lab4 goes on as normal next week  Tuesday review 6pm, place TBD  Last lecture  "Switching-network"
Programmable Logic Devices (PLDs)
1 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite.
EE207: Digital Systems I, Semester I 2003/2004
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Dr. Shi Dept. of Electrical and Computer Engineering.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.
Introduction to Computing Systems and Programming Digital Logic Structures.
CSI-2111 Structure of Computers Ipage Combinational Circuits  Objectives : To recognize the principal types of combinational circuits  Adders.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
نظام المحاضرات الالكترونينظام المحاضرات الالكتروني Main Memory Read Only Memory (ROM)
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 13 Edge-Triggered FF Operation.
Chapter- 9 Programmable Logic Devices DHADUK ANKITA ENRL NO Noble Engineering College- Junagadh.
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.
CENG 241 Digital Design 1 Lecture 13
Memory and Programmable Logic
Computer Architecture & Operations I
Computer Architecture & Operations I
ECE 434 Advanced Digital System L03
CPE/EE 422/522 Advanced Logic Design L02
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Lecture 11 Logistics Last lecture Today HW3 due now
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CSE 370 – Winter 2002 – Comb. Logic building blocks - 1
Presentation transcript:

ENGIN112 L31: Read Only Memory November 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 31 Read Only Memory (ROM)

ENGIN112 L31: Read Only Memory November 17, 2003 Overview °Read-only memory can normally only be read °Internal organization similar to SRAM °ROMs are effective at implementing truth tables Any logic function can be implemented using ROMs °Multiple single-bit functions embedded in a single ROM °Also used in computer systems for initialization ROM doesn’t lose storage value when power is removed °Very useful for implementing FSMs

ENGIN112 L31: Read Only Memory November 17, 2003 Read-Only Memory (ROM) °An array of semiconductor devices diodes transistors field effect transistors °2 N words by M bits °Data can be read but not changed (normal operating conditions)

ENGIN112 L31: Read Only Memory November 17, 2003 °N input bits °2 N words by M bits °Implement M arbitrary functions of N variables Example 8 words by 5 bits: Read-Only Memory (ROM) 3 Input Lines ABCABC F 0 F 1 F 2 F 3 F 4 5 Output Lines ROM 8 words x 5 bits

ENGIN112 L31: Read Only Memory November 17, 2003 °ROM = "Read Only Memory" values of memory locations are fixed ahead of time °A ROM can be used to implement a truth table if the address is m-bits, we can address 2 m entries in the ROM. our outputs are the bits of data that the address points to. m is the "height", and n is the "width" ROM Implementation mn

ENGIN112 L31: Read Only Memory November 17, 2003 °Suppose there are 10 inputs 10 address lines (i.e., 2 10 = 1024 different addresses) °Suppose there are 20 outputs °ROM is 2 10 x 20 = 20K bits (and a rather unusual size) °Rather wasteful, since lots of storage bits For functions, doesn’t take advantage of K-maps, other minimization ROM Implementation

ENGIN112 L31: Read Only Memory November 17, 2003 Each minterm of each function can be specified Read-Only Memory (ROM) 3 Inputs Lines ABCABC F 0 F 1 F 2 F 3 F 4 5 Outputs Lines ROM 8 words x 5 bits

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Internal Structure n Inputs Lines n bit decoder... m Outputs Lines Memory Array 2 n words x m bits

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Memory Array 3 to 8 decoder ABCABC m 0 =A’B’C’ m 1 =A’B’C m 2 =A’BC’ m 3 =A’BC m 4 =AB’C’ m 5 =AB’C m 6 =ABC’ m 7 =ABC F 0 F 1 F 2 F 3 F 4

ENGIN112 L31: Read Only Memory November 17, 2003 Inside the ROM °Alternate view Each possible horizontal/vertical intersection indicates a possible connection °Or gates at bottom output the word selected by the decoder (32 x 8)

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Example Specify a truth table for a ROM which implements: F = AB + A’BC’ G = A’B’C + C’ H = AB’C’ + ABC’ + A’B’C

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Example Specify a truth table for a ROM which implements: F = AB + A’BC’ G = A’B’C + C’ H = AB’C’ + ABC’ + A’B’C

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Example Specify a truth table for a ROM which implements: F = AB + A’BC’ G = A’B’C + C’ H = AB’C’ + ABC’ + A’B’C

ENGIN112 L31: Read Only Memory November 17, 2003 Function Implementation 3 to 8 decoder ABCABC m 0 =A’B’C’ m 1 =A’B’C m 2 =A’BC’ m 3 =A’BC m 4 =AB’C’ m 5 =AB’C m 6 =ABC’ m 7 =ABC F G H Each column is a new function Note: two outputs unused!

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Implementation of a Moore Machine °ROMs implement combinational logic °Note that ROMs do not hold state °How would you determine the maximum clock frequency of this circuit? Look at the FF to FF path (NS to PS) ROM Present State Next State Outputs Inputs

ENGIN112 L31: Read Only Memory November 17, 2003 ROM Implementation of a Mealy Machine °ROMs implement combinational logic °Note that ROMs do not hold state °How would you determine the maximum clock frequency of this circuit? Look at the FF to FF path (NS to PS) ROM Present State Next State Outputs Inputs

ENGIN112 L31: Read Only Memory November 17, 2003 Summary °ROMs provide stable storage for data °ROMs have address inputs and data outputs ROMs directly implement truth tables °ROMs can be used effectively in Mealy and Moore machines to implement combinational logic °In normal use ROMs are read-only They are only read, not written °ROMs are often used by computers to store critical information Unlike SRAM, they maintain their storage after the power is turned off