Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.

Slides:



Advertisements
Similar presentations
1 ECE 4436ECE 5367 Computer Arithmetic I-II. 2 ECE 4436ECE 5367 Addition concepts 1 bit adder –2 inputs for the operands. –Third input – carry in from.
Advertisements

Introduction So far, we have studied the basic skills of designing combinational and sequential logic using schematic and Verilog-HDL Now, we are going.
CPE 626 CPU Resources: Adders & Multipliers Aleksandar Milenkovic Web:
Chapter 9 Computer Design Basics. 9-2 Datapaths Reminding A digital system (or a simple computer) contains datapath unit and control unit. Datapath: A.
CSE-221 Digital Logic Design (DLD)
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 24 - Subsystem.
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
1 CS 140 Lecture 14 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego Some slides from Harris and Harris.
S. Reda EN160 SP’07 Design and Implementation of VLSI Systems (EN0160) Lecture 28: Datapath Subsystems 2/3 Prof. Sherief Reda Division of Engineering,
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Multipliers.
Digital Integrated Circuits 2e: Chapter Copyright  2002 Prentice Hall PTR, Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture.
Fall 2005 L15: Combinational Circuits Lecture 15: Combinational Circuits Complete logic functions Some combinational logic functions –Half adders –Adders.
VLSI Arithmetic Adders Prof. Vojin G. Oklobdzija University of California
CSE477 VLSI Digital Circuits Fall 2002 Lecture 20: Adder Design
Computer Structure - The ALU Goal: Build an ALU  The Arithmetic Logic Unit or ALU is the device that performs arithmetic and logical operations in the.
IMPLEMENTATION OF µ - PROCESSOR DATA PATH
Introduction to CMOS VLSI Design Lecture 11: Adders
Arithmetic-Logic Units CPSC 321 Computer Architecture Andreas Klappenecker.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
Lecture 17: Adders.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Crosstalk. n Power optimization.
ENGIN112 L26: Shift Registers November 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 26 Shift Registers.
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
Lecture 18: Datapath Functional Units
Combinational Circuits Chapter 3 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 2003.
Chapter 6-2 Multiplier Multiplier Next Lecture Divider
1. Copyright  2005 by Oxford University Press, Inc. Computer Architecture Parhami2 Figure 10.1 Truth table and schematic diagram for a binary half-adder.
+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.
Fall 2004EE 3563 Digital Systems Design EE 3563 Comparators  Comparators determine if two binary inputs are equal  Some will signal greater than/less.
Chapter 6-1 ALU, Adder and Subtractor
Arithmetic Building Blocks
Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.
1/8/ L3 Data Path DesignCopyright Joanne DeGroat, ECE, OSU1 ALUs and Data Paths Subtitle: How to design the data path of a processor.
Chapter 14 Arithmetic Circuits (I): Adder Designs Rev /12/2003
1 CPSC3850 Adders and Simple ALUs Simple Adders Figures 10.1/10.2 Binary half-adder (HA) and full-adder (FA). Digit-set interpretation: {0, 1}
Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.
Chap 7. Register Transfers and Datapaths. 7.1 Datapaths and Operations Two types of modules of digital systems –Datapath perform data-processing operations.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
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.
Modern VLSI Design 4e: Chapter 6 Copyright  2008 Wayne Wolf Topics n Shifters. n Adders and ALUs.
FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
CDA 3101 Fall 2013 Introduction to Computer Organization The Arithmetic Logic Unit (ALU) and MIPS ALU Support 20 September 2013.
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
EE141 © Digital Integrated Circuits 2nd Arithmetic Circuits 1 Digital Integrated Circuits A Design Perspective Arithmetic Circuits Jan M. Rabaey Anantha.
1 Arithmetic I Instructor: Mozafar Bag-Mohammadi Ilam University.
COMP541 Arithmetic Circuits
Computer Architecture Lecture 3 Combinational Circuits Ralph Grishman September 2015 NYU.
Topics covered: Arithmetic CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Digital Integrated Circuits© Prentice Hall 1995 Arithmetic Arithmetic Building Blocks.
EE466: VLSI Design Lecture 13: Adders
Orange Coast College Business Division Computer Science Department CS 116- Computer Architecture Arithmetic: Part II.
Digital Integrated Circuits 2e: Chapter Copyright  2002 Prentice Hall PTR, Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture.
Modern VLSI Design 3e: Chapter 8 Copyright  1998, 2002 Prentice Hall PTR Topics n Basics of register-transfer design: –data paths and controllers; –ASM.
ECE/CS 552: Arithmetic I Instructor:Mikko H Lipasti Fall 2010 University of Wisconsin-Madison Lecture notes partially based on set created by Mark Hill.
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.
1. 2 Figure 10.1 Truth table and schematic diagram for a binary half-adder Simple Adders Half-adder.
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003 Rev /05/2003.
Topic: N-Bit parallel and Serial adder
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003.
Combinational Circuits
Computer Design Basics
Swamynathan.S.M AP/ECE/SNSCT
Topics Number representation. Shifters. Adders and ALUs.
Part III The Arithmetic/Logic Unit
Computer Design Basics
Combinational Circuits
ECE 352 Digital System Fundamentals
Lecture 9 Digital VLSI System Design Laboratory
Presentation transcript:

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Combinational shifters n Useful for arithmetic operations, bit field extraction, etc. n Latch-based shift register can shift only one bit per clock cycle. n A multiple-shift shifter requires additional connectivity.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter n Can perform n-bit shifts in a single cycle. n Efficient layout. n Does require transmission gates and long wires.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter structure Accepts 2n data inputs and n control signals, producing n data outputs.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter operation n Selects arbitrary contiguous n bits out of 2n input buts. n Examples: –right shift: data into top, 0 into bottom; –left shift: 0 into top, data into bottom; –rotate: data into top and bottom.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter layout Two-dimensional array of 2n vertical X  n horizontal cells. n Input data travels diagonally upward. Output wires travel horizontally. n Control signals run vertically. Exactly one control signal is set to 1, turning on all transmission gates in that column.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter cell

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Barrel shifter in action

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Analysis n Large number of cells, but each one is small. n Delay is large, considering long wires and transmission gates.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Adders n Adder delay is dominated by carry chain. n Carry chain analysis must consider transistor, wiring delay. n Modern VLSI favors adder designs which have compact carry chains.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Full adder n Computes one-bit sum, carry: –s i = a i XOR b i XOR c i –c i+1 = a i b i + a i c i + b i c i n Ripple-carry adder: n-bit adder built from full adders. n Delay of ripple-carry adder goes through all carry bits.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Carry-lookahead adder n First compute carry propagate, generate: –P i = a i + b i –G i = a i b i n Compute sum and carry from P and G: –s i = c i XOR P i XOR G i –c i+1 = G i + P i c i

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Carry-lookahead expansion n Can recursively expand carry formula: –c i+1 = G i + P i (G i-1 + P i-1 c i-1 ) –c i+1 = G i + P i G i-1 + P i P i-1 (G i-2 + P i-1 c i-2 ) n Expanded formula does not depend on intermerdiate carries. n Allows carry for each bit to be computed independently.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Depth-4 carry-lookahead

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Analysis n Deepest carry expansion requires gates with large fanin: large, slow. n Carry-lookahead unit requires complex wiring between adders and lookahead unitalues must be routed back from lookahead unit to adder. n Layout is even more complex with multiple levels of lookahead.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Carry-skip adder n Looks for cases in which carry out of a set of bits is identical to carry in. n Typically organized into m-bit stages. n If a i != b i for every bit in stage, then bypass gate sends stage’s carry input directly to carry output.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Two-bit carry-skip structure

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Carry-select adder n Computes two results in parallel, each for different carry input assumptions. n Uses actual carry in to select correct result. n Reduces delay to multiplexer.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Carry-select structure

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Manchester carry chain n Precharged carry chain which uses P and G signals. n Propagate signal connects adjacent carry bits. n Generate signal discharges carry bit. n Worst-case discharge path goes through entire carry chain.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Manchester carry chain circuit

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Serial adder n May be used in signal-processing arithmetic where fast computation is important but latency is unimportant. n Data format (LSB first):

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Serial adder structure LSB control signal clears the carry shift register:

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR ALUs n ALU computes a variety of logical and arithmetic functions based on opcode. n May offer complete set of functions of two variables or a subset. n ALU built around adder, since carry chain determines delay.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Function block circuit

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Function blocks and ALUs n Function block may be used to compute required intermediate signals for a full- function ALU. n Requires little area. n Transmission gates may introduce significant delay.

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR ALU structure

Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR ALU design n P and G compute intermediate values from inputs. May not correspond to carry lookahead P and G for non-addition functions. n Add unit is adder of choice. n Output unit computes from sum, propagate signal.