Princess Sumaya University

Slides:



Advertisements
Similar presentations
Random-Access Memory (RAM)
Advertisements

1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.
COE 202: Digital Logic Design Combinational Circuits Part 1
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Lecture #9 EGR 277 – Digital Logic
1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
COE 202: Digital Logic Design Combinational Circuits Part 1
CENG 241 Digital Design 1 Lecture 12
PLAs Programmable Logic Arrays
Combinational Circuits
Read Only Memory (ROM) Number of words Size of word A block diagram of a ROM consisting of k inputs and n outputs is shown below. The inputs provide the.
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
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.
Digital Components and Combinational Circuits Sachin Kharady.
Logic and Computer Design Dr. Sanjay P. Ahuja, Ph.D. FIS Distinguished Professor of CIS ( ) School of Computing, UNF.
ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
ROM & PLA Digital Logic And Computer Design
Princess Sumaya University
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Programmable Logic Devices (PLDs)
Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014.
EE207: Digital Systems I, Semester I 2003/2004
Basic Gates 2.1 Basic Digital Logic: Application of Digital Gates using AND / OR / NOT ©Paul Godin Created August 2007 Last Update Sept 2013 Basic Gates.
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Random Access Memory (RAM).  A memory unit stores binary information in groups of bits called words.  The data consists of n lines (for n-bit words).
Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
Binary Parallel Adders
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
Programmable Logic Controller
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Appendix C Basics of Logic Design. Appendix C — Logic Basic — 2 Logic Design Basics §4.2 Logic Design Conventions Objective: To understand how to build.
CENG 241 Digital Design 1 Lecture 13
This chapter in the book includes: Objectives Study Guide
ETE Digital Electronics
Logic Devices. Decoder 2-to-4 Decoder 3-to-8 Decoder.
ECE 331 – Digital System Design
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Combinational Circuit Design
Lecture 9 Logistics Last lecture Today HW3 due Wednesday
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
This chapter in the book includes: Objectives Study Guide
ECE 434 Advanced Digital System L03
CPE/EE 422/522 Advanced Logic Design L02
FIGURE 7.1 Conventional and array logic diagrams for OR gate
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Programmable Logic Devices (PLDs)
SYEN 3330 Digital Systems Chapter 4 – Part 2 SYEN 3330 Digital Systems.
Programmable Configurations
Unit -06 PLDs.
Lecture 11 Logistics Last lecture Today HW3 due now
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
Chapter 10.3 and 10.4: Combinatorial Circuits
Combinational Circuits
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
FIGURE 5-1 MOS Transistor, Symbols, and Switch Models
Multiplexers Mux.
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Presentation transcript:

Princess Sumaya University 4241 - Digital Logic Design Read Only Memory (ROM) A block diagram of a ROM consisting of k inputs and n outputs is shown below. The inputs provide the address for memory, and the outputs give the data bits of the stored word that is selected by the address. The number of words in a ROM is determined from the fact that k address input lines are needed to specify 2k words. Number of words Size of word

Princess Sumaya University 4241 - Digital Logic Design Read Only Memory (ROM) Draw a 32  8 ROM. The unit consists of 32 words of 8 bits each.

Read Only Memory (ROM)

Read Only Memory (ROM) Inputs outputs . I4 I3 I2 I1 I0 A7 A6 A5 A4 A3 A2 A1 A0 1 0 1 1 0 1 1 0 0 0 0 0 0

Read Only Memory (ROM) Example 7.1: Design a combinational circuit using a ROM. The circuit accepts a three-bit number and outputs a binary number equal to the square of the input number. (minimize the ROM if possible)

Read Only Memory (ROM) Example 7.1: Design a combinational circuit using a ROM. The circuit accepts a three-bit number and outputs a binary number equal to the square of the input number. We need a ROM with a size = 8  4

Read Only Memory (ROM)

Programmable Logic Devices

Programmable Logic Array (PLA) F1=AB\+AC+A\BC\ F2=(AC+BC)\

Programmable Logic Array (PLA) Example 7.2 :Implement the following two Boolean functions with a PLA: F1(A, B, C) = (0,1,2,4) F2(A, B, C) = (0,5,6,7) F1 F2 F1= A\B\+A\C\+B\C\ F2= AB+AC+A\B\C\ F1= (AB+AC+BC)\ F2= (A\B+A\C+AB\C\)\

Programmable Logic Array F1= (AB+AC+BC)\ F2= AB+AC+A\B\C\ AB AC BC A\B\C\

16 14

2^15

Without minimizing With minimizing

Without minimizing

B) With minimizing