let7-Division I

Computer Arithmetic: Algorithms and Hardware Designs

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

View Full Document Right Arrow Icon
CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Fall 2006 Lecture 7 Division
Background image of page 1

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

View Full DocumentRight Arrow Icon
CSE 246 2 Topics: Division Restoring Division Nonrestoring Division High Radix Division
Background image of page 2
CSE 246 3 Division – Iteration effort Pencil and paper method: ( A=Q × B+2 -n R and R<B ) 1 bit partial quotient per iteration, n iterations A =0.111 0, B =0.010; Q = A / B. Q i : Partial Quotient R i : Partial Remainder R i+1 = R i – B × Q i Q = 0.1110 + 1 0 0 1 1 0 1 0 R 0 = A 1 0 1 0 1 1 0 R 2 1 0 1 0 1 0 0 R 3 0 0 0 1 0 0 R 4 1 0 1 0 1 1 0 0.1 1 0 0 0 R 1 Q 1 = 0.1 Q 2 = 0.01 Q 3 = 0.001 Q 4 = 0.0000
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Division – Memory effort Lookup table is the simplest way to obtain multiple partial quotient bits in each iteration. SRT method: a lookup tables stores m -bit partial quotients decided by m bits of partial remainder and m bits of divisor. Table size:
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/19/2008 for the course CSE 246 taught by Professor Cheng during the Fall '06 term at UCSD.

Page1 / 17

let7-Division I - CSE 246: Computer Arithmetic Algorithms...

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

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