EE365 Adv. Digital Circuit Design Clarkson University Lecture #9 Math Units ROMs.

Slides:

Advertisements

Similar presentations

Lecture 13: Sequential Circuits

Advertisements

Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika

1 Homework Reading –Tokheim, Chapter 12-1 through 12-4 Machine Projects –MP4 due at start of next class Labs –Continue with your assigned section.

1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.

1 DIGITAL DESIGN I DR. M. MAROUF MEMORY Read-only memories Static read/write memories Dynamic read/write memories Author: John Wakerly (CHAPTER 10.1 to.

COMP541 Memories - I Montek Singh Oct {8, 15}, 2014.

DPSD This PPT Credits to : Ms. Elakya - AP / ECE.

CSE-221 Digital Logic Design (DLD)

Chapter 10. Memory, CPLDs, and FPGAs

EE365 Adv. Digital Circuit Design Clarkson University Lecture #7 Intro to MSI PLDs and Decoders.

Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.

Faculty of Computer Science © 2006 CMPUT 229 Buses and Memories And Adders.

ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

Overview Recall Combinational Logic Sequential Logic Storage Devices

Digital Logic Design Lecture 18. Announcements HW 6 up on webpage, due on Thursday, 11/6.

ECE 301 – Digital Electronics

Digital Computers and Information Chapter 1 Mano and Kime.

1 EE365 Read-only memories Static read/write memories Dynamic read/write memories.

1 EE 365 Adders Multipliers Read-Only Memories 2 Equality Comparators 1-bit comparator 4-bit comparator EQ_L.

EE365 Adv. Digital Circuit Design Clarkson University Lecture #8 Buffers, Drivers, Encoders, MUXs & XORs.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

Adders, subtractors, ALUs

CS 105 Digital Logic Design

EECS 370 Discussion 1 xkcd.com. EECS 370 Discussion Topics Today: – Floating Point – Finite State Machines – Combinational Logic – Sequential Logic 2.

Memory and Programmable Logic

Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.

Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

Memory and Programmable Logic Dr. Ashraf Armoush © 2010 Dr. Ashraf Armoush.

1 COMP541 Memories - I Montek Singh Feb 29, 2012.

Power Point Presentation Donald Bearden CS 147 September 13, 2001.

Fall 2004EE 3563 Digital Systems Design EE 3563 Comparators  Comparators determine if two binary inputs are equal  Some will signal greater than/less.

WEEK #10 FUNCTIONS OF COMBINATIONAL LOGIC (ADDERS)

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Combinational vs.

Memory and Programmable Logic Memory device: Device to which binary information is transferred for storage, and from which information is available for.

Lecture 30 Read Only Memory (ROM)

Programmable Logic Devices

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

Digital Design: Principles and Practices

CSE115: Digital Design Lecture 20: Comparators, Adders and Subtractors Faculty of Engineering.

Princess Sumaya University

1 COMP541 Memories - I Montek Singh Oct 7, Topics  Overview of Memory Types Read-Only Memory (ROM): PROMs, FLASH, etc. Read-Only Memory (ROM):

ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices X-OR gates and Parity circuits Comparators Adders, subtractors,

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

Memory and Register. Memory terminology read/write operation volotile/non volatile determine the capacity from input and output timing requirements of.

Memory 10/27/081ECE Lecture. Memory Memory Types Using memory to implement logic functions 10/27/082ECE Lecture.

Universal college of engineering & technology. .By Harsh Patel)

EE121 John Wakerly Lecture #6

Computer Architecture Lecture 3 Combinational Circuits Ralph Grishman September 2015 NYU.

Combinational Circuits

ECE 331 – Digital System Design Multi-bit Adder Circuits, Adder/Subtractor Circuit, and Multiplier Circuit (Lecture #12)

1 Lecture 12: Adders, Sequential Circuits Today’s topics:  Carry-lookahead adder  Clocks, latches, sequential circuits.

CHAPTER 2 Digital Combinational Logic/Arithmetic Circuits

1 Fundamentals of Computer Science Combinational Circuits.

Introduction to Computing Systems and Programming Digital Logic Structures.

ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.

ETE 204 – Digital Electronics Combinational Logic Design Single-bit and Multiple-bit Adder Circuits [Lecture: 9] Instructor: Sajib Roy Lecturer, ETE,ULAB.

Interfacing Memory Interfacing.

Basics Combinational Circuits Sequential Circuits Ahmad Jawdat

Combinatorial Logic Design Practices

Fundamentals of Computer Science Part i2

Number Systems and Circuits for Addition

Digital Circuits and Logic

Half & Full Subtractor Half Subtractor Full Subtractor.

Half & Full Subtractor Half Subtractor Full Subtractor.

Presentation transcript:

EE365 Adv. Digital Circuit Design Clarkson University Lecture #9 Math Units ROMs

Topics Comparators Adders Multipliers ROMs Rissacher EE365Lect #9

Equality Comparators 1-bit comparator 4-bit comparator EQ_L Rissacher EE365Lect #9

8-bit Magnitude Comparator Rissacher EE365Lect #9

Other conditions Rissacher EE365Lect #9

Adders Basic building block is “full adder” –1-bit-wide adder, produces sum and carry outputs Truth table: XYCinSCout Rissacher EE365Lect #9

Full-adder circuit Rissacher EE365Lect #9

Ripple adder Speed limited by carry chain Faster adders eliminate or limit carry chain –2-level AND-OR logic ==> 2 n product terms –3 or 4 levels of logic, carry look-ahead Rissacher EE365Lect #9

74x283 4-bit adder Uses carry look-ahead internally Rissacher EE365Lect #9

“generate” “propagate” “half sum” carry-in from previous stage Rissacher EE365Lect #9

Ripple carry between groups Rissacher EE365Lect #9

Look-ahead carry between groups Rissacher EE365Lect #9

Subtraction is the same as addition of the two’s complement. The two’s complement is the bit-by-bit complement plus 1. Therefore, X – Y = X + Y + 1. –Complement Y inputs to adder, set C in to 1. –For a borrow, set C in to 0. Subtraction Rissacher EE365Lect #9

Full subtractor = full adder, almost Rissacher EE365Lect #9

Multipliers 8x8 multiplier Rissacher EE365Lect #9

Full-adder array Rissacher EE365Lect #9

Faster carry chain Rissacher EE365Lect #9

Read-Only Memories Rissacher EE365Lect #9

Why “ROM”? Program storage –Boot ROM for personal computers –Complete application storage for embedded systems. Actually, a ROM is a combinational circuit, basically a truth-table lookup. –Can perform any combinational logic function –Address inputs = function inputs –Data outputs = function outputs Rissacher EE365Lect #9

Logic-in- ROM example Rissacher EE365Lect #9

4x4 multiplier example Rissacher EE365Lect #9

Internal ROM structure PDP-11 boot ROM (64 words, 1024 diodes) Rissacher EE365Lect #9

Two-dimensional decoding ? Rissacher EE365Lect #9

Larger example, 32Kx8 ROM Rissacher EE365Lect #9

Today’s ROMs 256K bytes, 1M byte, or larger Use MOS transistors Rissacher EE365Lect #9

EEPROMs, Flash PROMs Programmable and erasable using floating-gate MOS transistors Rissacher EE365Lect #9

Typical commercial EEPROMs Rissacher EE365Lect #9

EEPROM programming Apply a higher voltage to force bit change –E.g., VPP = 12 V –On-chip high-voltage “charge pump” in newer chips Erase bits –Byte-byte –Entire chip (“flash”) –One block (typically 32K - 66K bytes) at a time Programming and erasing are a lot slower than reading (milliseconds vs. 10’s of nanoseconds) Rissacher EE365Lect #9

Microprocessor EPROM application Rissacher EE365Lect #9

ROM control and I/O signals Rissacher EE365Lect #9

Next time Latches Flip Flops Clocking Rissacher EE365Lect #9