loading...
On the Design of High-Radix On-Line Division for Long Precision
Adelaide, Australia April 14-April 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1999.76282714th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alexandre F. Tenca, Oregon State University
Milos D. Ercegovac, University of California at Los Angeles
We present a design of a high-radix on-line division suitable for long precision computations. The proposed scheme uses a quotient- digit selection function based on the residual rounding and scaling of the operands. The bounds on the number of cycles and the cycle time for radix 2^k and n-bit precision are obtained in terms of full- adder delays. The speedup with respect to radix 2 is greater than 3.3 for k>5 and n>63. The cost increases as a function of the radix. For the case r=64 and n=64, the increase in area with respect to r=2 is about 6.6 times plus a 512x10-bit table. The proposed scheme has been designed and verified using VHDL and a 1.2um CMOS standard gate technology from MOSIS library.
Citation:
Alexandre F. Tenca, Milos D. Ercegovac, "On the Design of High-Radix On-Line Division for Long Precision," arith, pp.44, 14th IEEE Symposium on Computer Arithmetic (ARITH-14 '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.