ECE COMBINATIONAL BUILDING BLOCKS - INVEST 16 READ ONLY MEMORIES

Similar documents
Programmable Logic Devices (PLDs)

CHAPTER 9 MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Very Large Scale Integration (VLSI)

EECS 270 Midterm Exam

EECS 150 Homework 7 Solutions Fall (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are:

Programmable Logic Devices

Programmable Logic Devices. Programmable Read Only Memory (PROM) Example

Simplification of Boolean Functions

ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring Logic and Computer Design Fundamentals.

Laboratory Exercise 1

Combinational Logic Use the Boolean Algebra and the minimization techniques to design useful circuits No feedback, no memory Just n inputs, m outputs

ECE 331 Digital System Design

CprE 281: Digital Logic

Digital Circuits ECS 371

Combinational Circuits Digital Logic (Materials taken primarily from:

ece5745-pla-notes.txt

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE4220. PROGRAMMABLE LOGIC DEVICES (PLDs)

Unit 6 1.Random Access Memory (RAM) Chapter 3 Combinational Logic Design 2.Programmable Logic

MEMORY AND PROGRAMMABLE LOGIC

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

Functional Block: Decoders

Outline. Field Programmable Gate Arrays. Programming Technologies Architectures. Programming Interfaces. Historical perspective

QUESTION BANK FOR TEST

CS6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN I YEAR/II SEM PART-B UNIT-I BOOLEAN ALGEBRA AND LOGIC GATES.

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

Code No: R Set No. 1

Good Evening! Welcome!

UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

Objectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure

SHRI ANGALAMMAN COLLEGE OF ENGINEERING. (An ISO 9001:2008 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI

COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

Optimized Implementation of Logic Functions

Review: Chip Design Styles

Introduction to Programmable Logic Devices (Class 7.2 2/28/2013)

IA Digital Electronics - Supervision I

2/8/2017. SOP Form Gives Good Performance. ECE 120: Introduction to Computing. K-Maps Can Identify Single-Gate Functions

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Chapter 4. Combinational Logic

Fig. 6-1 Conventional and Array Logic Symbols for OR Gate

EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

EECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.

There are only 16 possible 2-input gates Let s examine all of them. Some we already know, others are just silly.

LSN 6 Programmable Logic Devices

COMBINATIONAL LOGIC CIRCUITS


UNIT - V MEMORY P.VIDYA SAGAR ( ASSOCIATE PROFESSOR) Department of Electronics and Communication Engineering, VBIT

Chapter 4: Combinational Logic

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017

ECE20B, Spring Final Exam lab questions.

Programmable Logic Devices UNIT II DIGITAL SYSTEM DESIGN

Model EXAM Question Bank

211: Computer Architecture Summer 2016

Lec-6-HW-2-digitalDesign

Presentation 4: Programmable Combinational Devices

10EC33: DIGITAL ELECTRONICS QUESTION BANK

Section 6. Memory Components Chapter 5.7, 5.8 Physical Implementations Chapter 7 Programmable Processors Chapter 8

structure syntax different levels of abstraction

Here is a list of lecture objectives. They are provided for you to reflect on what you are supposed to learn, rather than an introduction to this

I 4 I 3 I 2 I 1 I 0 A 7 A 6 A 5 A 4 A 3 A 2 A 1 A 0 T-125. ROM Truth Table (Partial) 1997 by Prentice-Hall, Inc.

Combinational Logic Circuits Part III -Theoretical Foundations

FPGA: What? Why? Marco D. Santambrogio

Fundamentals of Computer Systems

Module -7. Karnaugh Maps

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS

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

Memory and Programmable Logic

ENEL Digital Circuits Midterm Examination

Lecture (05) Boolean Algebra and Logic Gates

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

END-TERM EXAMINATION

Code No: R Set No. 1

UMBC D 7 -D. Even bytes 0. 8 bits FFFFFC FFFFFE. location in addition to any 8-bit location. 1 (Mar. 6, 2002) SX 16-bit Memory Interface

R10. II B. Tech I Semester, Supplementary Examinations, May

Reference Sheet for C112 Hardware

Review: Standard forms of expressions

POWR IP PZ1/17

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)

Lab 16: Data Busses, Tri-State Outputs and Memory

10/24/2016. Let s Name Some Groups of Bits. ECE 120: Introduction to Computing. We Just Need a Few More. You Want to Use What as Names?!

BHARATHIDASAN ENGINEERING COLLEGE Degree / Branch : B.E./ECE Year / Sem : II/ III Sub.Code / Name : EC6302/DIGITAL ELECTRONICS

Chap-2 Boolean Algebra

Injntu.com Injntu.com Injntu.com R16

B.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN

Objectives: - You need to be able to use the two equations above and the series and parallel circuit rules.

1. Mark the correct statement(s)

UNIT V (PROGRAMMABLE LOGIC DEVICES)

Microcontroller Systems. ELET 3232 Topic 11: General Memory Interfacing

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

Combinational Logic Circuits

Digital Systems Design with PLDs and FPGAs Kuruvilla Varghese Department of Electronic Systems Engineering Indian Institute of Science Bangalore

Experiment 4 Boolean Functions Implementation

Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

SUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3

Area Efficient, Low Power Array Multiplier for Signed and Unsigned Number. Chapter 3

Transcription:

ECE 24 - CMBINATINAL BUILDING BLCKS - INVEST 6 READ NL MEMRIES FALL 23 A.P. FELZER To do "well" on this investigation you must not only get the right answers but must also do neat, complete and concise writeups that make obvious what each problem is, how you're solving the problem and what your answer is. ou also need to include drawings of all circuits as well as appropriate graphs and tables. Programmable logic devices in the form of PALs from the last Investigation are extremely useful combinational circuits used in many applications. ne particularly nice feature of PALs is their large number of inputs. But this comes at the price of limiting the number of minterms that can be included in the sums. The objective of this investigation is to introduce another kind of PLD called a RM. RMs have fewer inputs than PALs but include all the minterms. The value of every minterm can be specified.. In the last investigation we showed how to realize logic equations equal to sums of products with PALs having programmable AND arrays and fixed R arrays. A RM (Read nly Memory) is just like a PAL except that both its AND and R array are programmed. We call the inputs A A of a RM as follows A A the address lines of the RM. And we call the values of the output the contents of the RM. RMs like all combinational circuits are characterized by Truth Tables like the following A A If the user can change the contents being stored in a RM then we call the RM a PRM (Programmable Read nly Memory) or an EPRM (Electronically Programmable Read nly Memory). a. Why do we call the RM in this problem a 4x bit RM b. Why do we say this 4x bit RM stores 4 bits of information c. Draw a chip diagram for a 4x2 bit RM d. How many bits of information are stored in a RM that realizes the following Truth Table with three inputs and two outputs as follows

A2 A A F F 2. If we look inside a RM like the following 4x2 bit RM as follows 4x2 RM A A we'll see something like the following 2-to-4 Decoder D A A D D2 D3 with "little" boxes connected to the crossing wires. Some of the boxes contain circuit elements that are functionally equivalent to switches and some contain open circuits. For those boxes containing switches as follows 2

X the switches will be () CLSED and therefore connecting the two wires together when X=H (2) PEN and therefore keeping the two wires apart when X=L Now for the following RM 2-to-4 Decoder D A A D D2 D3 where means the box contains a ITCH and means it contains an PEN a. Find the truth table for this RM b. Make use of your truth table to obtain equations for and as sums of minterms c. Why do we need the resistors 3. Draw a RM with boxes containing switches and opens like in Problem (2) to realize the following truth table A A 4. Each box containing a switch or an open circuit in a RM like that in Problem (2) is referred to as a memory cell. And all the memory cells taken together form what we call a memory array. The size of a memory array is the number of rows by the number of columns. The RM in Problem (2) for example has a 4x2 bit memory array. Memorize these definitions. And then make use of them to find 3

a. How many cells are there in the memory array of a RM like that of Problem (2) but with 6 address lines and output b. How many cells are there in the memory array of a RM like that of Problem (2) but with 6 address lines and 2 outputs 5. The number of wires connecting the decoder to the memory array in a RM like that in Problem (2) can very quickly get very large as the number of address lines increases. ne way to reduce this problem is to rearrange the memory cells into more compact arrangements like the following RM with a 2x2 bit memory array -to-2 Decoder A D D A M 2-to- Multiplexer M Find the truth table for this RM and then use it to find the equation for 6. Realize the following truth table with a 2x4 bit memory array using a 2-input, 2-bit mux as follows A A 4

A -to-2 Decoder D D A M M N 4-to-2 Multiplexer N 7. Realize the following truth table with a 2x4 bit memory array A2 8. What dimensions would you choose for the memory array of a Kx bit RM. Why A A 5