Faithful powering computation using table look-up and a fused accumulation tree
Authors:
- J.D. BrugueraJBJ.D. Bruguera
- J.M. MullerJMJ.M. Muller
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636889,p. 40-47
Abstract
A method for the calculation of faithfully rounded single-precision floating-point powering (X/sup p/) 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 /spl mu/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.Keywords
This publication has 11 references indexed in Scilit:
- High-speed inverse square roots2003
- Exact rounding of certain elementary functions2002
- Symmetric bipartite tables for accurate function approximation2002
- Faithful bipartite ROM reciprocal tables2002
- Powering by a table look-up and a multiplication with operand modificationIEEE Transactions on Computers, 1998
- Elementary Functions1997
- Area and performance tradeoffs in floating-point divide and square-root implementationsACM Computing Surveys, 1996
- A universal nonlinear component and its application to WSIIEEE Transactions on Components, Hybrids, and Manufacturing Technology, 1993
- Merged ArithmeticIEEE Transactions on Computers, 1980
- On Division by Functional IterationIEEE Transactions on Computers, 1970