A fast radix 4 division algorithm

Author

Srinivas, Hosahalli R. ; Parhi, Keshab K.

Author_Institution

Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA

Volume

4

fYear

1994

fDate

30 May-2 Jun 1994

Firstpage

311

Abstract

In this paper we present a fast radix 4 division algorithm for floating point numbers based on Svoboda´s division algorithm. The algorithm involves a simple recurrence with carry-free addition and employs pre-scaling of the operands, The quotient digits are determined by observing three most-significant radix 2 digits (msds) of the partial remainder and independent of the divisor. The proposed algorithm is faster than previously proposed radix 4 and radix 2 division algorithms, which require at least four digits of the partial remainder to be observed to determine a quotient digit. The speedup is achieved at cost of increase in area

Keywords

digital arithmetic; dividing circuits; floating point arithmetic; redundant number systems; Svoboda´s division algorithm; carry-free addition; floating point numbers; most-significant radix 2 digits; partial remainder; pre-scaling; quotient digits; radix 4 division algorithm; simple recurrence; Computer architecture; Contracts; Costs; Delay effects; Floating-point arithmetic; Hardware; Logic;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on

Conference_Location

London

Print_ISBN

0-7803-1915-X

Type

conf

DOI

10.1109/ISCAS.1994.409259

Filename

409259