1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 5 Digital Building Blocks.

Slides:



Advertisements
Similar presentations
컴퓨터구조론 교수 채수환. 교재 Computer Systems Organization & Architecture John D. Carpinelli, 2001, Addison Wesley.
Advertisements

Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.
EET 1131 Unit 7 Arithmetic Operations and Circuits
THE ARITHMETIC-LOGIC UNIT. BINARY HALF-ADDER BINARY HALF-ADDER condt Half adder InputOutput XYSC
DATAPATHS 3) Shifters. 4) Comparators 5) Counters.
1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.
Lecture 9 Sept 28 Chapter 3 Arithmetic for Computers.
Assembly Language and Computer Architecture Using C++ and Java
Chapter 6 Arithmetic. Addition Carry in Carry out
ECE C03 Lecture 61 Lecture 6 Arithmetic Logic Circuits Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Digital Arithmetic Wen-Hung Liao, Ph.D.. Objectives Perform binary addition, subtraction, multiplication, and division on two binary numbers. Add and.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Logic and Computer Design Dr. Sanjay P. Ahuja, Ph.D. FIS Distinguished Professor of CIS ( ) School of Computing, UNF.
1 ECE369 Chapter 3. 2 ECE369 Multiplication More complicated than addition –Accomplished via shifting and addition More time and more area.
ECE 301 – Digital Electronics
Arithmetic Operations and Circuits
Chapter 12 Digital Logic Circuit Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
©2008 The McGraw-Hill Companies, Inc. All rights reserved. Digital Electronics Principles & Applications Seventh Edition Chapter 10 Arithmetic Circuits.
3-1 Chapter 3 - Arithmetic Computer Architecture and Organization by M. Murdocca and V. Heuring © 2007 M. Murdocca and V. Heuring Computer Architecture.
Chapter 6-2 Multiplier Multiplier Next Lecture Divider
3-1 Chapter 3 - Arithmetic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles of Computer Architecture.
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
1. Copyright  2005 by Oxford University Press, Inc. Computer Architecture Parhami2 Figure 10.1 Truth table and schematic diagram for a binary half-adder.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Chapter 5 :: Digital Building Blocks
Introduction to Chapter 6  Digital circuits are frequently used for arithmetic operations  Fundamental arithmetic operations on binary numbers and digital.
P. 4.1 Digital Technology and Computer Fundamentals Chapter 4 Digital Components.
1 Appendix J Authors: John Hennessy & David Patterson.
Figure 5.1. Conversion from decimal to binary.. Table 5.1. Numbers in different systems.
Lecture 1 Binary Representation Topics Terminology Base 10, Hex, binary Fractions Base-r to decimal Unsigned Integers Signed magnitude Two’s complement.
Figure 5.1. Conversion from decimal to binary.. Table 5.1. Numbers in different systems.
Figure 5.1 Conversion from decimal to binary. Table 5.1 Numbers in different systems.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Arithmetic Building Blocks
07/19/2005 Arithmetic / Logic Unit – ALU Design Presentation F CSE : Introduction to Computer Architecture Slides by Gojko Babić.
CSE 241 Computer Organization Lecture # 9 Ch. 4 Computer Arithmetic Dr. Tamer Samy Gaafar Dept. of Computer & Systems Engineering.
Arithmetic Building Blocks
Computer Arithmetic and the Arithmetic Unit Lesson 2 - Ioan Despi.
July 2005Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.
Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.
Chapter 1 Data Storage © 2007 Pearson Addison-Wesley. All rights reserved.
REGISTER TRANSFER & MICROOPERATIONS By Sohaib. Digital System Overview  Each module is built from digital components  Registers  Decoders  Arithmetic.
FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.
Topics covered: Arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
CS/EE 3700 : Fundamentals of Digital System Design Chris J. Myers Lecture 5: Arithmetic Circuits Chapter 5 (minus 5.3.4)
Chapter 5 Computer System Architectures Chapter 5 Based on Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris.
1 Overview of CS 151 Fall Combinational Logic Design –Simplifying a logic function using algebraic method –Truth table and logic function representation.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
MicroProcessors Lec. 4 Dr. Tamer Samy Gaafar. Course Web Page —
S 2/e C D A Computer Systems Design and Architecture Second Edition© 2004 Prentice Hall Chapter 6 Overview Number Systems and Radix Conversion Fixed point.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
1. Copyright  2005 by Oxford University Press, Inc. Computer Architecture Parhami2 Figure 11.1 Multiplication of 4-bit numbers in dot notation.
1 Digital Logic Design (41-135) Chapter 5 Number Representation & Arithmetic Circuits Younglok Kim Dept. of Electrical Engineering Sogang University Spring.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.
This chapter in the book includes: Objectives Study Guide
Computer Design Basics
Digital Arithmetic Wen-Hung Liao, Ph.D..
Principles & Applications
Digital System Design Review.
Digital Building Blocks
Unsigned Multiplication
12/7/
Computer Design Basics
Table 1.1 Powers of Two.
XOR Function Logic Symbol  Description  Truth Table 
Half & Full Subtractor Half Subtractor Full Subtractor.
Half & Full Subtractor Half Subtractor Full Subtractor.
Lecture 10: Sequential Blocks Arrays
Presentation transcript:

1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 5 Digital Building Blocks

2 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit half adder

3 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.2 Carry bit

4 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit full adder

5 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.4 Carry propagate adder

6 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit ripple-carry adder

7 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.6 (a) 32-bit carry-lookahead adder (CLA), (b) 4-bit CLA block

8 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit prefix adder

9 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.8 Synthesized adder

10 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.9 Subtractor: (a) symbol, (b) implementation

11 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.10 Synthesized subtractor

12 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit equality comparator: (a) symbol, (b) implementation

13 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.12 N-bit magnitude comparator

14 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.13 Synthesized comparators

15 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.14 ALU symbol

16 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.15 N-bit ALU

17 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit shifters: (a) shift left, (b) logical shift right, (c) arithmetic shift right

18 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.17 Multiplication: (a) decimal, (b) binary

19 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  4 multiplier: (a) symbol, (b) function, (c) implementation

20 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.19 Synthesized multiplier

21 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.20 Array divider

22 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.21 Fixed-point notation of 6.75 with four integer bits and four fraction bits

23 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.22 Fixed-point representation of 2.375: (a) absolute value, (b) sign and magnitude, (c) two’s complement

24 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.23 Fixed-point two’s complement conversion

25 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.24 Addition: (a) binary fixed-point, (b) decimal equivalent

26 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.25 Floating-point numbers

27 Copyright © 2013 Elsevier Inc. All rights reserved. Figure bit floating-point version 1

28 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.27 Floating-point version 2

29 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.28 IEEE 754 floating-point notation

30 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.29 Floating-point addition

31 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.30 Counter symbol

32 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.31 N-bit counter

33 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.32 Synthesized counter

34 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.33 Shift register symbol

35 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.34 Shift register schematic

36 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.35 Shift register with parallel load

37 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.36 Synthesized shiftreg

38 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.37 Scannable flip-flop: (a) schematic, (b) symbol, and (c) N-bit scannable register

39 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.38 Generic memory array symbol

40 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3 memory array: (a) symbol, (b) function

41 Copyright © 2013 Elsevier Inc. All rights reserved. Figure Kb array: depth = 2 10 = 1024 words, width = 32 bits

42 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.41 Bit cell

43 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3 memory array

44 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.43 Three-ported memory

45 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.44 DRAM bit cell

46 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.45 DRAM stored values

47 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.46 SRAM bit cell

48 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  32 register file with two read ports and one write port

49 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.48 ROM bit cells containing 0 and 1

50 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3 ROM: dot notation

51 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3 ROM implementation using gates

52 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.51 Fuse-programmable ROM bit cell

53 Copyright © 2013 Elsevier Inc. All rights reserved. Figure word  1-bit memory array used as a lookup table

54 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.53 Synthesized ram

55 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.54 M  N  P-bit PLA

56 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3  2-bit PLA: dot notation

57 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3  2-bit PLA using two-level logic

58 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.57 General FPGA layout

59 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.58 Cyclone IV Logic Element (LE) (Reproduced with permission from the Altera Cyclone  IV Handbook 2010 Altera Corporation.)

60 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.59 LE configuration for two functions of up to four inputs each

61 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.60 LE configuration for one function of more than four inputs

62 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.61 LE configuration for FSM with two bits of state

63 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.62 ROM implementation: (a) dot notation, (b) pseudo-nMOS circuit

64 Copyright © 2013 Elsevier Inc. All rights reserved. Figure  3  2-bit PLA using pseudo-nMOS circuits

65 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.64 Funnel shifter

66 Copyright © 2013 Elsevier Inc. All rights reserved. Figure 5.65 ROM circuits

67 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 01

68 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 02

69 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 03

70 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 04

71 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 05

72 Copyright © 2013 Elsevier Inc. All rights reserved. Figure M 06

73 Copyright © 2013 Elsevier Inc. All rights reserved. UNN Figure 1