Faithful powering computation using table look-up and a fused accumulation tree

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2001, Pages 40-47

  Pineiro J A ^a   Bruguera, J D ^a   Muller, J M ^a  

^a UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CMOS INTEGRATED CIRCUITS; INTERPOLATION; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; QUADRATIC PROGRAMMING; TREES (MATHEMATICS);

FUSED ACCUMULATION TREE;

DIGITAL ARITHMETIC;

EID: 0034872071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. High-performance hardware for function generation
2. Faithful bipartite rom reciprocal tables
3. On division by functional iteration
4. A universal nonlinear component and its application to WSI
5. On binary multiplication using the quarter square algorithm
6. Symmetric bipartite tables for accurate function approximation
7. High-speed reciprocal approximations
8. Exact rounding of certain elementary functions
9. High-speed inverse square roots
10. Area and performance trade-offs in floating point divide and square root implementations
11. Merged arithmetic
12. Powering by a table look-up and a multiplication with operand modification
13. Table-lookup algorithms for elementary functions and their error analysis