Fast radix 4 division algorithm

Hosahalli R. Srinivas, Keshab K Parhi

Research output: Contribution to journalConference article

8 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)311-314
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume4
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

Fingerprint

Costs

Cite this

Fast radix 4 division algorithm. / Srinivas, Hosahalli R.; Parhi, Keshab K.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 4, 01.12.1994, p. 311-314.

Research output: Contribution to journalConference article

@article{81937d52524548f8849c42786cb22ecb,
title = "Fast radix 4 division algorithm",
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.",
author = "Srinivas, {Hosahalli R.} and Parhi, {Keshab K}",
year = "1994",
month = "12",
day = "1",
language = "English (US)",
volume = "4",
pages = "311--314",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Fast radix 4 division algorithm

AU - Srinivas, Hosahalli R.

AU - Parhi, Keshab K

PY - 1994/12/1

Y1 - 1994/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028562806&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028562806&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0028562806

VL - 4

SP - 311

EP - 314

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -