EE357Unit2a_Mult

EE357Unit2a_Mult - Mark Redekopp, All rights reserved EE...

Info iconThis preview shows pages 1–15. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Mark Redekopp, All rights reserved EE 357 Unit 2a Multiplication Techniques Mark Redekopp, All rights reserved Learning Objectives Perform by hand the different methods for unsigned and signed multiplication Understand the various digital implementations of a multiplier along with their tradeoffs Sequential add and shift method Basic combinational array multiplier Booth and/or Bit-Pair multiplier Mark Redekopp, All rights reserved MULTIPLICATION TECHNIQUES Add and Shift Method (Sequential) Booths Coding and Bit-Pair Recoding Mark Redekopp, All rights reserved Unsigned Multiplication Review Same rules as decimal multiplication Multiply each bit of Q by M shifting as you go An m-bit * n-bit mult. produces an m+n bit result (i.e. n-bit * n-bit produces 2*n bit result) Notice each partial product is a shifted copy of M or 0 (zero) 1010 * 1011 1010 1010_ 0000__ + 1010___ 01101110 M (Multiplicand) Q (Multiplier) PP(Partial Products) P (Product) Mark Redekopp, All rights reserved Multiplication Techniques A multiplier unit can be Purely Combinational: Each partial product is produced in parallel and fed into an array of adders to generate the product Sequential and Combinational: Produce and add 1 partial product at a time (per cycle) Mark Redekopp, All rights reserved Combinational Multiplier Partial Product (PP i ) Generation Multiply Q[i] * M if Q[i]=0 => PP i = 0 if Q[i]=1 => PP i = M AND gates can be used to generate each partial product M[3] M[2] M[1] M[0] M[3] M[2] M[1] M[0] Q[i]=0 if Q[i]=1 if 1 1 1 1 M[3] M[2] M[1] M[0] Mark Redekopp, All rights reserved Combinational Multiplier Partial Products must be added together Combinational multipliers suffer from long propagation delay through the adders propagation delay is proportional to the number of partial products (i.e. number of bits of input) and the width of each adder Mark Redekopp, All rights reserved Adder Propagation Delay X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1111 + 0001 Mark Redekopp, All rights reserved X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1111 + 0001 1 1 1 1 1 Adder Propagation Delay Mark Redekopp, All rights reserved X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1 1 1 1 1 1 1 1 1 1111 + 0001 Adder Propagation Delay Mark Redekopp, All rights reserved X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1 1 1 1 1 1 1 1 1 1111 + 0001 1 1 Adder Propagation Delay Mark Redekopp, All rights reserved X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1 1 1 1 1 1 1 1 1111 + 0001 1 Adder Propagation Delay Mark Redekopp, All rights reserved X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y S Ci Co FA FA 1 1 1 1 1 1 1 1111 + 0001 1 1 Adder Propagation Delay Mark Redekopp, All rights reserved Critical Path Critical Path = Longest possible delay path X Y S Ci Co X Y S Ci Co FA FA X Y S Ci Co X Y...
View Full Document

This note was uploaded on 04/04/2010 for the course EE 357 taught by Professor Mayeda during the Spring '08 term at USC.

Page1 / 72

EE357Unit2a_Mult - Mark Redekopp, All rights reserved EE...

This preview shows document pages 1 - 15. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online