5-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL 62901.

Slides:



Advertisements
Similar presentations
MEMORY popo.
Advertisements

Chapter 5 Internal Memory
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
Memory Address Decoding
+ CS 325: CS Hardware and Software Organization and Architecture Internal Memory.
Khaled A. Al-Utaibi 8086 Bus Design Khaled A. Al-Utaibi
Memory Devices and Interfacing – (Chapter 9)
5-1 Memory System. Logical Memory Map. Each location size is one byte (Byte Addressable) Logical Memory Map. Each location size is one byte (Byte Addressable)
SYSTEM CLOCK Clock (CLK) : input signal which synchronize the internal and external operations of the microprocessor.
Memory (RAM) Organization Each location is addressable Addresses are binary numbers Addresses used at different granularities –each bit is possible, but.
Kevin Walsh CS 3410, Spring 2010 Computer Science Cornell University Memory See: P&H Appendix C.8, C.9.
Chapter 9 Memory Basics Henry Hexmoor1. 2 Memory Definitions  Memory ─ A collection of storage cells together with the necessary circuits to transfer.
ENGIN112 L30: Random Access Memory November 14, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 30 Random Access Memory (RAM)
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE Computer Organization Lecture 20 - Memory.
2-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL Fundamentals of Digital.
Memory Interface Dr. Esam Al_Qaralleh CE Department
Overview Memory definitions Random Access Memory (RAM)
4-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL Hardware Detail of Intel.
Memory Hierarchy.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
1 COMP 206: Computer Architecture and Implementation Montek Singh Wed., Nov. 13, 2002 Topic: Main Memory (DRAM) Organization.
Registers  Flip-flops are available in a variety of configurations. A simple one with two independent D flip-flops with clear and preset signals is illustrated.
CS 151 Digital Systems Design Lecture 30 Random Access Memory (RAM)
Chapter 5 Internal Memory
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.
Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.6 Random Access Memories.
Overview Booth’s Algorithm revisited Computer Internal Memory Cache memory.
Physical Memory and Physical Addressing By: Preeti Mudda Prof: Dr. Sin-Min Lee CS147 Computer Organization and Architecture.
Memory Technology “Non-so-random” Access Technology:
University of Tehran 1 Microprocessor System Design Omid Fatemi Memory Interfacing
Memory Basics Chapter 8.
Physical Memory By Gregory Marshall. MEMORY HIERARCHY.
Memory interface Memory is a device to store data
Memory and I/O Interfacing
8088 I/F with basic IO, RAM and 8255
Address Decoding Memory/IO.
Survey of Existing Memory Devices Renee Gayle M. Chua.
BASIC INPUT AND OUTPUT INTERFACING.  8085A communicate with outside world using the I/O devices.  Since memory and I/O devices share the system bus,
Memory interface Memory is a device to store data
Chapter 5 Internal Memory. Semiconductor Memory Types.
Lecture 19 Today’s topics Types of memory Memory hierarchy.
Minimum System Requirements Clock Generator Memory Interfacing.
Memory and Storage Dr. Rebhi S. Baraka
Memory System Unit-IV 4/24/2017 Unit-4 : Memory System.
CS 312 Computer Architecture Memory Basics Department of Computer Science Southern Illinois University Edwardsville Summer, 2015 Dr. Hiroshi Fujinoki
CPEN Digital System Design
Digital Logic Design Instructor: Kasım Sinan YILDIRIM
SEQUENTIAL CIRCUITS Component Design and Use. Register with Parallel Load  Register: Group of Flip-Flops  Ex: D Flip-Flops  Holds a Word of Data 
Asynchronous vs. Synchronous Counters Ripple Counters Deceptively attractive alternative to synchronous design style State transitions are not sharp! Can.
Chapter 11Chapter 12 Memory system designI/O system design Objectives: The importance of bus buffering How the 8088 addresses (accesses) memory - I/O ports.
+ CS 325: CS Hardware and Software Organization and Architecture Memory Organization.
Memory Read only memory (ROM) – nonvolatile
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
Memory Devices 1. Memory concepts 2. RAMs 3. ROMs 4. Memory expansion & address decoding applications 5. Magnetic and Optical Storage.
COMP541 Memories II: DRAMs
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Memory 2 ©Paul Godin Created March 2008 Memory 2.1.
DIGITAL SYSTEMS Read Only– and Random Access Memory ( ROM – RAM) Rudolf Tracht and A.J. Han Vinck.
Gunjeet Kaur Dronacharya Group of Institutions. Outline I Random-Access Memory Memory Decoding Error Detection and Correction Read-Only Memory Programmable.
Computer Architecture Chapter (5): Internal Memory
RAM RAM - random access memory RAM (pronounced ramm) random access memory, a type of computer memory that can be accessed randomly;
University of Tehran 1 Microprocessor System Design Omid Fatemi.
EE3541 Introduction to Microprocessors
8086/8088 Hardware Specifications
Computer Architecture & Operations I
Digital Logic & Design Dr. Waseem Ikram Lecture 40.
MICROPROCESSOR MEMORY ORGANIZATION
Presentation transcript:

5-1 ECE 424 Design of Microprocessor-Based Systems Haibo Wang ECE Department Southern Illinois University Carbondale, IL 62901

5-2 Connections Between CPU and Memory 8088 Memory Address bus Data Bus Control signals  What are the control signals from the microprocessor to memory? What are the control signal from memory to the microprocessor?  Address and data signals should be buffered — The use of buffers on address bus increases driving capability — Bi-directional buffers are used to control the data transferring directions on data bus — D latches are used to de-multiplex signals on AD[7:0] (and A[19:16])

5-3 Timing Diagram of A Memory Operation  Example: 8088 sends address 70C12 to memory in a memory read operation assume that data 30H is read A[15:8 ] AD[7:0] Addr[15:0] Buffer D latch Trans -ceiver D[7:0] DT/R DEN IO/M WR RD 8088 Memory T1 T2 T3T4 CLK ALE A[19:16] 7HS3-S6 A[15:8]0CH AD[7:0]12H30H D latch Addr[19:16]7H Addr[15:8]0CH Addr[7:0]12H 30HD[7:0]

5-4  Design a 1MB memory system consisting of multiple memory chips Memory Address Decoding — Solution 1: 256KB Addr[17:0] Addr[18] Addr[19] IO/M CS 2-to-4 decoder

5-5  Design a 1MB memory system consisting of multiple memory chips — Solution 2: 256KB Addr[19:2] Addr[1] Addr[0] IO/M CS 2-to-4 decoder Memory Address Decoding

5-6  Design a 1MB memory system consisting of multiple memory chips Memory Address Decoding — Solution 3: 256KB Addr[19:18] Addr[17] Addr[6] IO/M CS 2-to-4 decoder Addr[16:7] Addr[5:0] It is a bad design, but still works! Does it work if the last memory chip is removed?

5-7 Memory Address Decoding  Design a 1MB memory system consisting of multiple memory chips — Solution 4: 256KB 512KB CS Addr[17:0] Addr[18] Addr[19] IO/M Addr[18] Addr[19] IO/M Addr[18] Addr[19] IO/M

5-8 Memory Address Decoding FFFFF FFF 32KB Addr[19:0] These 5 address lines are not changed. They set the base address These 15 address lines select one of the 2 15 (32768) locations inside the RAMs Lowest address Highest address Addr[19] Addr[18] Addr[17] Addr[16] Addr[15] IO/M Addr[14:0] CS 32KB  Using partial memory addressing space Can we design a decoder such that the first address of the 32KB memory is 37124H?

5-9 Memory Address Decoding  Exercise Problem: — A 64KB memory chip is used to build a memory system with the starting address of 7000H. A block of memory locations in the memory chip are damaged. 64KB 0000H 3210H 3317H FFFFH Damaged block 70000H 73210H 73317H 7FFFFH 1M addressing space 73200H 733FFH 1M addressing space Replace this block

5-10 Memory Address Decoding CS A[19] A[18] A[17] A[16] IO/M A[15] A[14] A[13] A[12] A[11] A[10] A[9] 64KB 512B A[15:0] A[8:0]

5-11 Memory Address Decoding  Exercise Problem: — A 2MB memory chip with a damaged block (from 0DCF12H to H) is used to build a 1MB memory system for an 8088-based computer H 1FFFFFH 0FFFFFH H 0DCF12H Damaged block H 1FFFFFH 18FFFFH 07FFFFH 512K Use these two blocks CS A[20] A[19:0] A[19]

5-12 Memory Address Decoding  Partial decoding — Example:  build a 32KB memory system by using four 8KB memory chips  The starting address of the 32KB memory system is 30000H 30000H 32000H 34000H 36000H Chip #1 Chip #2 Chip #3 Chip #4 Low addr. of chip #1 high addr. of chip #1 Low addr. of chip #2 high addr. of chip #2 Low addr. of chip #3 high addr. of chip #3 Low addr. of chip #4 high addr. of chip #4

5-13 Memory Address Decoding — Implementation of partial decoding Addr[12:0] IO/M CS 2-to-4 decoder Addr[13] Addr[14] CS 8KB  With the above decoding scheme, what happens if the processor accesses location 02117H, 32117H, and 9A117H?  If two 16KB memory chips are used to implement the 32KB memory system, what is the partial decoding circuit?  What are the advantage and disadvantage of partial decoding circuits?

5-14 Generating Wait States  Wait states are inserted into memory read or write cycles if slow memories are used in computer systems  Ready signal is used to indicate if wait states are needed 8088 memory data Address decoder Delay circuit Ready QDQD clk Ready clr

5-15 SRAM v.s. DRAM Static Random Access Memory (SRAM) Dynamic Random Access Memory (DRAM) Storage element Advantages 1.Fast 2.No refreshing operations 1.High density and less expensive Disadvantages 1.Large silicon area 2.expensive 1.Slow 2.Require refreshing operations Applications High speed memory applications, Such as cache Main memories in computer systems

5-16 Accessing DRAMs  DRAM block diagram Addr[7:0] CAS RAS Storage Array Column decoder Row decoder RAS CAS Addr[7:0] Row addr. Column addr.

5-17 Accessing DRAMs  Address bus selection circuit QDQD CLK set QD Q decoder address IO/M RAS CAS To DRAM Row Address Column Address MUX

5-18 Accessing DRAMs  Refreshing operations — Because leakage current will destroy information stored on DRAM capacitors periodic refreshing operations are required for DRAM circuits — During refreshing operation, DRAM circuit are not able to response processor’s request to perform read or write operations — How to suspend memory operations? — DRAM controllers are developed to take care DRAM refreshing operations