By Topic

Fixed-Point Square Roots Using L-b Truncation [DSP Tips and Tricks]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Abhishek Seth ; Is pursuing his M.Eng. degree (research) in the School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore. ; Woon-Seng Gan

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.

Published in:

IEEE Signal Processing Magazine  (Volume:28 ,  Issue: 6 )