Fast division algorithm with a small lookup table

Author

Hung, Patrick ; Fahmy, Hossam ; Mencer, Oskar ; Flynn, Michael J.

Author_Institution

Comput. Syst. Lab., Stanford Univ., CA, USA

Volume

2

fYear

1999

fDate

24-27 Oct. 1999

Firstpage

1465

Abstract

This paper presents a new division algorithm, which requires two multiplication operations and a single lookup in a small table. The division algorithm takes two steps. The table lookup and the first multiplication are processed concurrently in the first step, and the second multiplication is executed in the next step. This divider uses a single multiplier and a lookup table with 2/sup m/(2m+1) bits to produce 2 m-bit results that are guaranteed correct to one ulp. By using a multiplier and a 12.5 KB lookup table, the basic algorithm generates a 24-bit result in two cycles.

Keywords

dividing circuits; fixed point arithmetic; series (mathematics); table lookup; 24 bit; Taylor series expansion; divider; fast division algorithm; fixed point numbers; multiplication operations; multiplier; signal processing; small lookup table; Application software; Computer graphics; Delay; Encoding; Equations; Iterative algorithms; Laboratories; Signal processing algorithms; Table lookup; Taylor series;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems, and Computers, 1999. Conference Record of the Thirty-Third Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-5700-0

Type

conf

DOI

10.1109/ACSSC.1999.831992

Filename

831992