Lecture 16: Address decoding



Similar documents
EXERCISES OF FUNDAMENTALS OF COMPUTER TECHNOLOGY UNIT 5. MEMORY SYSTEM

LECTURE 13: Cross-validation

CS100: Introduction to Computer Science

Multiplexers and Demultiplexers

Your organization has a Class B IP address of Before you implement subnetting, the Network ID and Host ID are divided as follows:

Domain 1: Designing a SQL Server Instance and a Database Solution

(VCP-310)

Modified Line Search Method for Global Optimization

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

CS103X: Discrete Structures Homework 4 Solutions

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

Systems Design Project: Indoor Location of Wireless Devices

Confidence Intervals for One Mean

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

Memory Basics. SRAM/DRAM Basics

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT


A N. O N Output/Input-output connection

Properties of MLE: consistency, asymptotic normality. Fisher information.

MICROPROCESSOR AND MICROCOMPUTER BASICS

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

5: Introduction to Estimation

Domain 1: Configuring Domain Name System (DNS) for Active Directory

Department of Computer Science, University of Otago

Chapter 10 Computer Design Basics

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

Confidence Intervals

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Security Functions and Purposes of Network Devices and Technologies (SY0-301) Firewalls. Audiobooks

Memory. The memory types currently in common usage are:

Development of Stability Program at a Cord Blood Bank

Chapter 5: Inner Product Spaces

Convexity, Inequalities, and Norms

Chapter 7 Methods of Finding Estimators

We r e going to play Final (exam) Jeopardy! "Answers:" "Questions:" - 1 -

I. Chi-squared Distributions

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

Ekkehart Schlicht: Economic Surplus and Derived Demand

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Finding the circle that best fits a set of points

EUROCONTROL PRISMIL. EUROCONTROL civil-military performance monitoring system

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

Theorems About Power Series

2-3-4 Trees and Red- Black Trees

Chapter 7: Confidence Interval and Sample Size

Non-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring

MACHINE ARCHITECTURE & LANGUAGE

A gentle introduction to Expectation Maximization

Domain 1 Components of the Cisco Unified Communications Architecture

5.3. Generalized Permutations and Combinations

Conversion Instructions:

Research Method (I) --Knowledge on Sampling (Simple Random Sampling)

Handout 17. by Dr Sheikh Sharif Iqbal. Memory Unit and Read Only Memories

PUBLIC RELATIONS PROJECT 2016

Ken blanchard college of business

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

Mobile Client Architecture Web vs. Native vs. Hybrid Apps

iprox sensors iprox inductive sensors iprox programming tools ProxView programming software iprox the world s most versatile proximity sensor

Objectives. Units of Memory Capacity. CMPE328 Microprocessors (Spring ) Memory and I/O address Decoders. By Dr.

To c o m p e t e in t o d a y s r e t a i l e n v i r o n m e n t, y o u n e e d a s i n g l e,

Hypergeometric Distributions

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

RAM & ROM Based Digital Design. ECE 152A Winter 2012

Agenda. Outsourcing and Globalization in Software Development. Outsourcing. Outsourcing here to stay. Outsourcing Alternatives

Topic 5: Confidence Intervals (Chapter 9)

Section 11.3: The Integral Test

Electrostatic solutions for better efficiency

CS100: Introduction to Computer Science

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

Design and Implementation of a Publication Database for the Vienna University of Technology

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

IT Support n n support@premierchoiceinternet.com. 30 Day FREE Trial. IT Support from 8p/user

QUADRO tech. FSA Migrator 2.6. File Server Migrations - Made Easy

Predictive Modeling Data. in the ACT Electronic Student Record

Semiconductor Devices

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN

Two-Phased Mapping & Identifier/Locator Network Protocol (ILNP) Youn-Hee Han, Hyon-Young Choi

The Canadian Council of Professional Engineers

Introduction to Demand Planning & Forecasting

Did you know that houses with CCTV are 90% less likely to be burgled? Yale now offer a range of Easy Fit CCTV systems

Elementary Theory of Russian Roulette

Domain 1 - Describe Cisco VoIP Implementations

ODBC. Getting Started With Sage Timberline Office ODBC

Baan Service Master Data Management

Engineering Data Management

Matched Filter Decoding of Random Binary and Gaussian Codes in Broadband Gaussian Channel

A Flexible Web-Based Publication Database

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Configuring Additional Active Directory Server Roles

CSE2102 Digital Design II - Topics CSE Digital Design II

The analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

Hypothesis testing. Null and alternative hypotheses

MICROPROCESSOR. Exclusive for IACE Students iacehyd.blogspot.in Ph: /422 Page 1

Incremental calculation of weighted mean and variance

BaanERP. BaanERP Windows Client Installation Guide

Transcription:

Lecture 16: Address decodi Itroductio to address decodi Full address decodi Partial address decodi Implemeti address decoders Examples Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 1

Itroductio to address decodi Althouh the memory space i the 68000 is said to be flat, it does ot mea that the physical implemetatio of memory is homoeeous Differet portios of memory are used for differet purposes: RAM, ROM, I/O devices Eve if all the memory was of oe type, we still have to implemet it usi multiple ICs This meas that for a ive valid address, oe ad oly oe memory-mapped compoet must be accessed Address decodi is the process of eerati chip select () sials from the address bus for each device i the system The address bus lies are split ito two sectios the N most siificat bits are used to eerate the sials for the differet devices the M least siificat sials are passed to the devices as addresses to the differet memory cells or iteral reisters Address decodi stratey Memory map M SB L SB Address lies. 2 N blocks N bits to decoder M bits to memory 2 M address rae Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 2

A very simple example Let s assume a very simple microprocessor with 10 address lies (1KB memory) Let s assume we wish to implemet all its memory space ad we use 128x8 memory chips SOLUTION We will eed 8 memory chips (8x128=1024) We will eed 3 address lies to select each oe of the 8 chips Each chip will eed 7 address lies to address its iteral memory cells 7 MEM 0 MEM 4 Memory map 10 3 3-to-8 decoder MEM 1 MEM 5 MEM 0 MEM 1 MEM 2 MEM 3 CPU MEM 2 MEM 6 MEM 4 MEM 5 MEM 3 MEM 7 MEM 6 MEM 7 Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 3

Address decodi methods The previous example specified that all addressable memory space was to be implemeted but There are some situatios where this requiremet is ot ecessary or affordable If oly a portio of the addressable space is oi to be implemeted there are two basic address decodi strateies Full address decodi All the address lies are used to specify a memory locatio Each physical memory locatio is idetified by a uique address Partial address decodi Sice ot all the address space is implemeted, oly a subset of the address lies are eeded to poit to the physical memory locatios Each physical memory locatio is idetified by several possible addresses (usi all combiatios of the address lies that were ot used) Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 4

Full address decodi Let s assume the same microprocessor with 10 address lies (1KB memory) However, this time we wish to implemet oly 512 bytes of memory We still must use 128-byte memory chips Physical memory must be placed o the upper half of the memory map SOLUTION Used for Address Decodi Used to referece memory cells o each memory IC Device A9 A6 A5 A4 A3 A2 A1 A0 MEM 0 0 0 0 X X X X X X X MEM 1 0 0 1 X X X X X X X MEM 2 0 1 0 X X X X X X X MEM 3 0 1 1 X X X X X X X Memory map A9 CS MEM0 CS MEM1 CS MEM2 CS MEM3 MEM 0 MEM 1 MEM 2 MEM 3 Not used Not used Not used Not used Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 5

Partial address decodi Let s assume the same microprocessor with 10 address lies (1KB memory) However, this time we wish to implemet oly 512 bytes of memory We still must use 128-byte memory chips Physical memory must be placed o the upper half of the memory map SOLUTION Not used Used for Address Decodi Used to referece memory cells o each memory IC Device A9 A6 A5 A4 A3 A2 A1 A0 MEM 0 X 0 0 X X X X X X X MEM 1 X 0 1 X X X X X X X MEM 2 X 1 0 X X X X X X X MEM 3 X 1 1 X X X X X X X CS MEM0 CS MEM1 CS MEM2 CS MEM3 Memory map MEM 0 MEM 1 MEM 2 MEM 3 MEM 1 MEM 2 MEM 3 MEM 4 Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 6

Implemeti address decoders Discrete loic Hih speed (propaatio sials) Hih chip-cout Lacks flexibility Data decoders More appropriate tha radom loic The selectio of devices is determied by the physical wiri All the memory blocks must have the same size Prorammable Read Oly Memory (PROM) Versatile, sice the selectio of devices is determied by the prorammi Memory blocks ca be of differet sizes Lookup tables ca become very lare for more tha 8 address lies Other methods (beyod the scope of the lecture) are Field Prorammable Gate Arrays (FPGA) ad Prorammable Address Decoders Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 7

Example 1 A circuit cotaii 64K words of RAM is to be iterfaced to a 68000-based system, so that the first address of RAM (the base address) is at $480000 Solutio What is the etire rae of RAM addresses? Desi a FULL address decoder usi two 64K 8 RAM ICs The address rae for the RAM is from $480000 to $480000+(128K=$20000)=$4A0000-1=$49FFFF The two ICs must be differetiated throuh UDS*/LDS* (sice the 68000 DOES NOT have A 0 ) 4 8 or 9 0 to F 0 to F 0 to F 0 to F A21 A20 A19 A18 A17 A16 A15 A14 A13 A12 A11 A10 A9 A6 A5 A4 A3 A2 A1 A0 0 1 0 0 1 0 0 X X X X X X X X X X X X X X X X X These 7 address lies set the base address of the memory These 16 address lies will select oe of the 2 16 (64K) locatios iside each RAM IC This address lie is implemeted with UDS*/LDS* A 23 A 22 A 21 A 20 SEL UDS SEL D8-D15 A 19 A 18 A 17 AS* LDS SEL D0-D7 Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 8

Example 2 A 68000-based system is to be built with these memory requiremets a 16K word EPROM with a starti address of $60 0000 a 16K word RAM with a starti address of $70 0000 Desi a FULL address decoder for this applicatio usi 16K 8 chips for both EPROM ad RAM $60 0000 + (16KWord=32KB=$8000)-1=$60 7FFF $70 0000 + (16KWord=32KB=$8000)-1=$70 7FFF ROM 6 0 0 to 7 0 to F 0 to F 0 to F A22 A21 A20 A19 A18 A17 A16 A15 A14 A13 A12 A11 A10 A9 A6 A5 A4 A3 A2 A1 A0 0 1 1 0 0 0 0 0 0 X X X X X X X X X X X X X X X RAM A22 7 0 0 to 7 0 to F 0 to F 0 to F A21 A20 A19 A18 A17 A16 A15 A14 A13 A12 0 1 1 1 0 0 0 0 0 X X X X X X X X X X X X X X X A 23 A 22 A 21 A 19 A 18 A 17 A 16 A 15 A 20 AS* ROMSEL RAMSEL A11 A10 A9 UDS LDS UDS LDS A6 A5 A4 A3 A2 A1 ROMSEL D8-D15 ROMSEL D0-D7 RAMSEL D8-D15 RAMSEL D0-D7 A0 Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 9

Example 3 Desi a PARTIAL address decoder for a 68000-based system with oly 8K words of EPROM space, ad a base address at $4000, usi 8Kx8 memory chips 0 0 4 to 7 0 to F 0 to F 0 to F A21 A20 A19 A18 A17 A16 A15 A14 A13 A12 A11 A10 A9 A6 A5 A4 A3 A2 A1 A0 0 0 0 0 0 0 0 0 0 1 X X X X X X X X X X X X X X Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 10

Example 4 Desi a partial address decoder for a 68000- based system that cotais 2MB of EPROM at a starti address $00 0000 usi 512Kx8 chips 2MB of RAM at a starti address $10 0000 usi 256Kx8 chips 64KB I/O space starti at $FF0000 SOLUTION For the EPROM we will eed 4 512Kx8 chips, oraized as 2 pairs of 512x8 chips (i order to use UDS*/LDS*). We will call these pairs ROM1 ad ROM2 For the RAM we will eed 8 256Kx8 chips, oraized as 4 pairs of 256Kx8: RAM1 to RAM4 Microprocessor-based System Desi Ricardo Gutierrez-Osua Wriht State Uiversity 11