A Fast Radix-4 Division Algorithm and its Architecture

Hosahalli R. Srinivas, Keshab K. Parhi

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


In this paper we present a fast radix-4 division algorithm for floating point numbers. This method is based on Svoboda's division algorithm and the radix-4 redundant number system. The algorithm involves a simple recurrence with carry-free addition and employs prescaling of the operands. In the proposed divider implementation, each radix-4 digit (belonging to set {−3, …, +3}) of the quotient and partial remainder is encoded using two radix-2 digits (belonging to the set [formula omitted] and this leads to hardware simplicity. The quotient digits are determined by observing three most-significant radix-2 digits of the partial remainder and independent of the divisor. The architecture presented for the proposed algorithm is faster than previously proposed radix-4 dividers, which require at least four digits of the partial remainder to be observed to determine quotient digits.

Original languageEnglish (US)
Pages (from-to)826-831
Number of pages6
JournalIEEE Transactions on Computers
Issue number6
StatePublished - Jun 1995

Bibliographical note

Funding Information:
This research was supported by the U.S. Ofice of Naval Research under contract number N00014-91-J-1008.


  • Fast division
  • Svoboda's technique
  • quotient selection
  • radix-4 division
  • redundant number system


Dive into the research topics of 'A Fast Radix-4 Division Algorithm and its Architecture'. Together they form a unique fingerprint.

Cite this