Back to Search
Start Over
Floating-Point Inverse Square Root Algorithm Based on Taylor-Series Expansion.
- Source :
- IEEE Transactions on Circuits & Systems. Part II: Express Briefs; Jul2021, Vol. 68 Issue 7, p2640-2644, 5p
- Publication Year :
- 2021
-
Abstract
- This brief describes a segmented structure to deal with inverse square root in floating-point digital calculation arithmetic, based on Taylor-Series expansion; it uses only the small number of their expansion terms to achieve a fast evaluation of these functions in high precision. Taylor-series expansions of the inverse square root are examined for several center points with their convergence ranges, and the inverse square root calculation algorithm trade-offs among accuracy, numbers of multiplications/additions/subtractions and LUT sizes are shown; the designer can choose the optimal algorithm for his digital inverse square root calculation, and build its conceptual dedicated hardware architecture design with the contents described here. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15497747
- Volume :
- 68
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Circuits & Systems. Part II: Express Briefs
- Publication Type :
- Academic Journal
- Accession number :
- 151282845
- Full Text :
- https://doi.org/10.1109/TCSII.2021.3062358