Chap. 8 Datapath Units: Multiplier Design

Slides:



Advertisements
Similar presentations
1 Integer Multipliers. 2 Multipliers A must have circuit in most DSP applications A variety of multipliers exists that can be chosen based on their performance.
Advertisements

1 Specifications Functionality: AND, OR, XOR, ADD Maximum propagation delay : 2ns Power budget: 30mW Area: 200 µm ×400µm Prepared by: Christie Ma, Manjul.
Lecture Adders Half adder.
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Lecture 5.
Prof. John Nestor ECE Department Lafayette College Easton, Pennsylvania ECE VLSI Circuit Design Lecture 24 - Subsystem.
VLSI Design Spring03 UCSC By Prof Scott Wakefield Final Project By Shaoming Ding Jun Hu
Design and Implementation of VLSI Systems (EN1600) Lecture 26: Datapath Subsystems 2/4 Prof. Sherief Reda Division of Engineering, Brown University Spring.
Noise Canceling in 1-D Data: Presentation #6 Seri Rahayu Abd Rauf Fatima Boujarwah Juan Chen Liyana Mohd Sharipp Arti Thumar M2 Feb 23 rd, 2005 Functional.
EE466: VLSI Design Lecture 14: Datapath Functional Units.
Multiplication.
Homework 2 Due 28 th May Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates)
CS 105 Digital Logic Design
Calculator Lab Overview Note: Slides Updated 10/8/12
Lecture 18: Datapath Functional Units
Aug Shift Operations Source: David Harris. Aug Shifter Implementation Regular layout, can be compact, use transmission gates to avoid threshold.
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
Digital Integrated Circuits Chpt. 5Lec /29/2006 CSE477 VLSI Digital Circuits Fall 2002 Lecture 21: Multiplier Design Mary Jane Irwin (
Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.
Computer Architecture, The Arithmetic/Logic UnitSlide 1 Part III The Arithmetic/Logic Unit.
Adding the Superset Adder to the DesignWare IP Library
CPEN Digital System Design
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003 Rev /05/2003.
Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.
EE141 Arithmetic Circuits 1 Chapter 14 Arithmetic Circuits Rev /12/2003.
Full Adder Truth Table Conjugate Symmetry A B C CARRY SUM
Lecture 18: Datapath Functional Units. CMOS VLSI DesignCMOS VLSI Design 4th Ed. 18: Datapath Functional Units2 Outline  Multipliers.
Chapter Contents 3.1 Overview 3.2 Fixed Point Addition and Subtraction
Chap 3. Combinational Logic Design
Combinational Circuits
ECE 3130 Digital Electronics and Design
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Multiplier Design [Adapted from Rabaey’s Digital Integrated Circuits, Second Edition, ©2003 J. Rabaey, A. Chandrakasan, B. Nikolic]
CSE477 VLSI Digital Circuits Fall 2003 Lecture 21: Multiplier Design
CSE 575 Computer Arithmetic Spring 2003 Mary Jane Irwin (www. cse. psu
Homework Reading Machine Projects Labs
Combinational Logic Circuits
1 Integer Multipliers. 2 Multipliers A must have circuit in most DSP applications A variety of multipliers exists that can be chosen based on their performance.
Multipliers Multipliers play an important role in today’s digital signal processing and various other applications. The common multiplication method is.
Reference: Moris Mano 4th Edition Chapter 4
Unsigned Multiplication
FIGURE 4.1 Block diagram of combinational circuit
VLSI Arithmetic Lecture 10: Multipliers
Digital Integrated Circuits A Design Perspective
Multiplier-less Multiplication by Constants
Subject Name: Fundamentals Of CMOS VLSI Subject Code: 10EC56
Integer Multipliers.
Number Systems and Circuits for Addition
Topics Multipliers..
Chapter 5 – Number Representation and Arithmetic Circuits
Digital System Design Combinational Logic
Homework Reading Machine Projects Labs
UNIVERSITY OF MASSACHUSETTS Dept
Multiple function unit design
UNIVERSITY OF MASSACHUSETTS Dept
Lecture 9 Digital VLSI System Design Laboratory
Comparison of Various Multipliers for Performance Issues
XOR Function Logic Symbol  Description  Truth Table 
LOGIC Circuits.
Instructor: Alexander Stoytchev
UNIVERSITY OF MASSACHUSETTS Dept
Description and Analysis of MULTIPLIERS using LAVA
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Prof. An-Yeu Wu Undergraduate VLSI Course Updated: May 24, 2002
Booth Recoding: Advantages and Disadvantages
Arithmetic Building Blocks
Chapter 14 Arithmetic Circuits (II): Multiplier Rev /12/2003
Instructor: Alexander Stoytchev
Lecture 2 Adders Half adder.
Presentation transcript:

Chap. 8 Datapath Units: Multiplier Design Prof. An-Yeu Wu Undergraduate VLSI Design Course Updated: June 12, 2002

Several Implementations of Multipliers Array Multiplier 2’s Complement Array Multiplier Serial Multiplier CSD Code String-encoding Multiplier Modified Booth-encoded Multiplier Implementation (Chap. 8.2.7.2) A. Y. Wu

6-by-6 Multiplication A. Y. Wu

Wallace-Tree Multiplication FA is a “one’s counter”: Take A, B, and C inputs and encodes them on SUM and CARRY outputs. A 1-bit full adder (FA) provides a 3:2 compression in the number of bits. A+B+C=2C+S A. Y. Wu

7-bit Wallace tree addition A. Y. Wu

Ex: 6×6 Wallace Multiplier A. Y. Wu

Example In a 32-bit multiplier, the maximum number of partial products is 32 and the compressions are: 32 → 22 → 16 → 12 → 8 → 6 → 4 → 3 → 2 => There are 9 Full-adder (FA) delays in the array c.f. Array multiplier (Booth-recoded) =16 partial products to be summed up. Can be used together with Booth-encoding scheme A. Y. Wu

Wallace Tree Multiplier MxN Booth-encoded multiplier (IEEE JSSC, vol.1,no.2, June 1993) A. Y. Wu

A typical delay distribution of the output of Wallace tree section A. Y. Wu

Extension 32-bits Wallace-tree multiplier has 9 FA delays in the array Questions: For a 64-bit multiplier, what is the minimum adder delay? Is there any way to reduce the delay by other compression scheme? A. Y. Wu

Approach: Using 4:2 compression adder The 4:2 compression (really 5:3) has three XOR delays in the SUM path. c.f.: Four XOR delays will be present if two adders are used A. Y. Wu

Referenced Paper A 54x54 regularly structured tree multiplier: IEEE Journal of Solid-State Circuits (vol. 27, no.9, 1992) A. Y. Wu

Chap. 8.2.7.2: Implementation of Booth-encoded Multiplier A. Y. Wu

Implementation: Radix-n Multiplication Modified Booth-recoding Values Xi-1 Xi Xi+1 OPERATION NEG ZERO TWO 0 0 0 add0 1 1 0 0 0 1 add2 0 0 1 0 1 0 sub1 1 0 0 0 1 1 add1 0 0 0 1 0 0 sub1 1 0 0 1 0 1 add1 0 0 0 1 1 0 sub2 1 0 1 1 1 1 add0 0 1 0 A. Y. Wu

16*16 Booth Multiplier A. Y. Wu

Array schematic A. Y. Wu

Array Floorplaning A. Y. Wu

First Rank Schematic A. Y. Wu

Booth decoding Schematic A. Y. Wu

Booth-Add-16 rank floorplan A. Y. Wu

Adder rank schematic A. Y. Wu

Booth gate A. Y. Wu

Array adder layout A. Y. Wu

Carry Propagate Adder A. Y. Wu

Homework #6 (Cancelled) Design an 8-bit Modified Booth-encoded (or String-encoding based) Wallace-tree Multiplier Draw the schematic diagram of your design. Verify your design first using C/C++ or Matlab programs. Write down the Verilog/VHDL code and perform simulation. Verify your Verilog/VHDL codes. That is,check your simulation results with the C/C++/Matlab results. Show your (1) Schematic (2) Source code (3) Simulation results in your report. Due date: June 28, 2002. A. Y. Wu