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

Slides:



Advertisements
Similar presentations
Kuliah Rangkaian Digital Kuliah 7: Unit Aritmatika
Advertisements

Programmable Logic PAL, PLA.
Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Microprocessor System Design. Outline Address decoding Chip select Memory configurations.
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.
DPSD This PPT Credits to : Ms. Elakya - AP / ECE.
Parallel Adder Recap To add two n-bit numbers together, n full-adders should be cascaded. Each full-adder represents a column in the long addition. The.
Chapter 10. Memory, CPLDs, and FPGAs
Parity. 2 Datasheets TTL:  CMOS: 
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.
Chapter 5 Internal Memory
1 EE365 Three-state Outputs Encoders Multiplexers XOR gates.
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.
Adders.
4-bit adder, multiplexer, timing diagrams, propagation delays
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
MEMORY.
Adders, subtractors, ALUs
CS 105 Digital Logic Design
Top-down modular design
Memory and Programmable Logic
Combinational and Sequential Logic Circuits.
Binary Addition CSC 103 September 17, 2007.
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Memory and Programmable Logic Dr. Ashraf Armoush © 2010 Dr. Ashraf Armoush.
1 COMP541 Memories - I Montek Singh Feb 29, 2012.
IKI a-Combinatorial Components Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture Notes.
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)
1 Adders & Subtractors Adders –An adder is a combinational logic circuit that performs the addition of 2 binary numbers (A & B) to generate the sum (S)
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.
Field-programmable logic devices FPLA circuits –Packaged PLA components with a fuse at every diode in both the AND and OR sections, that can be configured.
Memory and Programmable Logic Memory device: Device to which binary information is transferred for storage, and from which information is available for.
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
1 ECNG 1014: Digital Electronics Combinational Circuits.
Digital Design: Principles and Practices
Chapter
CSE115: Digital Design Lecture 20: Comparators, Adders and Subtractors Faculty of Engineering.
Princess Sumaya University
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.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #9 Math Units ROMs.
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)
IC design options PLD (programmable logic device)
CHAPTER 2 Digital Combinational Logic/Arithmetic 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.
Programmable Logic Devices
Logic Devices. Decoder 2-to-4 Decoder 3-to-8 Decoder.
MEMORY.
Computer Architecture & Operations I
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Combinatorial Logic Design Practices
Programmable Configurations
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Presentation transcript:

1 EE 365 Adders Multipliers Read-Only Memories

2 Equality Comparators 1-bit comparator 4-bit comparator EQ_L

3 8-bit Magnitude Comparator

4 Other conditions

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

6 Full-adder circuit

7 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 lookahead

8 74x283 4-bit adder Uses carry lookahead internally

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

10 Ripple carry between groups

11 Lookahead carry between groups

12 Subtraction 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.

13 Full subtractor = full adder, almost

14 Multipliers 8x8 multiplier

15 Full-adder array

16 Faster carry chain

17 Read-Only Memories

18 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

19 Logic-in-ROM example

20 4x4 multiplier example

21 Internal ROM structure PDP-11 boot ROM (64 words, 1024 diodes)

22 Two-dimensional decoding ?

23 Larger example, 32Kx8 ROM

24 Today’s ROMs 256K bytes, 1M byte, or larger Use MOS transistors

25 EEPROMs, Flash PROMs Programmable and erasable using floating-gate MOS transistors

26 Typical commercial EEPROMs

27 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)

28 Microprocessor EPROM application

29 ROM control and I/O signals

30 ROM timing