loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01)
Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree
Vail, Colorado
June 11-June 13
ISBN: 0-7695-1150-3
J.A. Piñeiro, University Santiago de Compostela
J.D. Bruguera, University Santiago de Compostela
J.M. Muller, Ecole Normale Superieure de Lyon
Abstract: A method for the calculation of faithfully rounded single-precision floating-point powering (Xp ) is proposed in this paper. This method employs table look-up and a second-degree minimax approximation, which allows the employment of reduced size tables to store the coefficients from the polynomial approximation. A specialized squaring unit and a fused accumulation tree carry out with the computation of the quadratic polynomial. Both unfolded and pipelined architectures are presented, and the results of a pre-layout synthesis performed using CMOS 0.35 ?m technology are shown, achieving a 50% area reduction from linear approximation methods, and with improved speed over other second-degree approximation based algorithms. The pipelined architecture has a latency of three cycles and a throughput of one result per cycle.
Citation:
J.A. Piñeiro, J.D. Bruguera, J.M. Muller, "Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree," arith, pp.0040, 15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.