No abstract

No abstract

No abstract

In this work we briefly review the basic CORDIC algorithm and its drawbacks. Next, we propose an adaptive CORDIC algorithm (a-CORDIC) which removes all the CORDIC drawbacks: (a) the number of iterations is reduced, (b) full machine accuracy is assured, (c) the scale-factor problem is eliminated, (d) the operating range is unlimited, (e) computation noise is reduced, and (f) ability to utilize the fast multiply/accumulate instructions now prevalent in digital signal processing (DSP) chips is added. The new algorithm uses a better strategy for choosing the step size in each iteration, but requires a parallel multiplier and extra look-up tables. This condition is easily satisfied in most new microprocessor chips. Simulation results, assuming 32-bit floating-point data format, are presented which clearly show the advantages of the proposed algorithm.Dans ce travail nous rappelons brievement les bases de 1'algorithme CORDIC ainsi que ses ctesavantages. Par la suite nous proposons un algorithme CORDIC adaptatif (a-CORDIC) qui 61imine tous les d6savantages de 1'algorithme CORDIC original: (a) le nombre d'itdrations est r6duit, (b) la precision maximale de la machine est assured, (c) le probleme du facteur d'gchelle est 61imin6, (d) la plage de travail devient illimitee, (e) le bruit relief au processus de calcul est r6duit et (f) 1'utilisation des instructions de multiplications/accumulations rapides disponibles dans les circuits int6gr6s DSP devient possible.

No abstract

No abstract

No abstract

No abstract