By Topic

Multiplier-Free Divide, Square Root, and Log Algorithms [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
$31 $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

4 Author(s)
Auger, F. ; Dept. of Phys. Meas., Univ. of Nantes, Nantes, France ; Zhen Lou ; Feuvrie, B. ; Feng Li

Many signal processing algorithms require the computation of the ratio of two numbers, the square root of a number, or a logarithm. These operations are difficult when using fixed point hardware that lack dedicated multipliers, such as low-cost microcontrollers, application specific integrated circuits (ASICs), and field programmable gate arrays (FPGAs). This article presents straightforward, multiplier free algorithms that implement both division and square roots, based on a technique known as dichotomous coordinate descent (DCD) (See [1] as a starting point, where several articles by the same authors are referenced.) We also make available a multiplier-free logarithm algorithm. All these algo rithms are based on iterative methods, which compute the successive ele ments of a sequence of approximate solutions, just like the Gauss-Seidel, Jacobi, and conjugate gradient methods [2]. We begin our discussion with a scheme for computing the ratio of two real numbers.

Published in:

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