Fast radix 4 division algorithm

Hosahalli R. Srinivas, Keshab K Parhi

Research output: Contribution to journalConference articlepeer-review

9 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)311-314
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Dec 1 1994
EventProceedings of the 1994 IEEE International Symposium on Circuits and Systems. Part 3 (of 6) - London, England
Duration: May 30 1994Jun 2 1994


Dive into the research topics of 'Fast radix 4 division algorithm'. Together they form a unique fingerprint.

Cite this