EE357Unit2a_Mult_Notes

EE357Unit2a_Mult_Notes - Learning Objectives Objectives EE...

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

View Full Document Right Arrow Icon
E 357 Unit 2a EE 357 Unit 2a Multiplication Techniques © Mark Redekopp, All rights reserved earning Objectives Learning Objectives erform by hand the different methods for Perform by hand the different methods for unsigned and signed multiplication nderstand the various digital • Understand the various digital implementations of a multiplier along with eir tradeoffs their tradeoffs – Sequential add and shift method – Basic combinational array multiplier – Booth and/or Bit-Pair multiplier © Mark Redekopp, All rights reserved dd and Shift Method (Sequential) ULTIPLICATION Add and Shift Method (Sequential) Booth’s Coding and Bit-Pair Recoding MULTIPLICATION TECHNIQUES © Mark Redekopp, All rights reserved nsigned Multiplication Review Unsigned Multiplication Review • Same rules as decimal multiplication p • Multiply each bit of Q by M shifting as you go • An m-bit * n-bit mult. produces an ________________ (i.e. n-bit * n-bit produces ________________) • Notice each partial product is a shifted copy of ___ or ___ 1010 * 1011 M (Multiplicand) Q (Multiplier) © Mark Redekopp, All rights reserved
Background image of page 1

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

View Full DocumentRight Arrow Icon
ultiplication Techniques Multiplication Techniques multiplier unit can be A multiplier unit can be – Purely Combinational: Each partial product is roduced in parallel and fed into an array of produced in parallel and fed into an array of adders to generate the product equential and Combinational: Produce and Sequential and Combinational: Produce and add 1 partial product at a time (per cycle) © Mark Redekopp, All rights reserved ombinational Multiplier Combinational Multiplier artial Product (PP Generation Partial Product (PP i ) Generation – Multiply Q[i] * M • if Q[i]=0 => PP i = 0 • if Q[i]=1 => PP i = M – ______ can be used to generate each partial roduct product M[3] M[2] M[1] M[0] Q[ i] 0 0 0 0 © Mark Redekopp, All rights reserved 0 0 0 0 ombinational Multiplier Combinational Multiplier
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

EE357Unit2a_Mult_Notes - Learning Objectives Objectives EE...

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

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