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 language | English (US) |
|---|---|
| Pages (from-to) | 311-314 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 4 |
| State | Published - Dec 1 1994 |
Fingerprint
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 journal › Article
}
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 - Article
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 -