Fixed-Point Square Roots Using L-b Truncation [DSP Tips and Tricks]
Authors:
- 1 November 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Magazine
- Vol. 28 (6) , 149-153
Abstract
In this article, we describe several techniques to reduce computational workload of the Newton-Raphson (NR)-based fixed-point square rooting method. Using the described techniques, the computational workload of NR methods can be reduced at the expense of memory. These new techniques outperform existing fixed-point square rooting methods both in terms of results accuracy and computational efficiency.Keywords
This publication has 4 references indexed in Scilit:
- A root of less evil [digital signal processingIEEE Signal Processing Magazine, 2005
- A new DSP-oriented algorithm for calculation of the square root using a nonlinear digital filterIEEE Transactions on Signal Processing, 1992
- Survey of square rooting algorithmsIEE Proceedings E Computers and Digital Techniques, 1990
- Some Properties of Iterative Square-Rooting Methods Using High-Speed MultiplicationIEEE Transactions on Computers, 1972