A Low-Cost Floating Point Vectoring Algorithm Based on CORDIC

In this paper we develop a CORDIC-based floating-point vectoring algorithm which reduces significantly the amount of microrotation steps as compared to the conventional algorithm. The overhead required to accomplish this is minimized by the introduction of an angle selection function which considers only a few of the total amount of bits used to represent the vector being rotated. At the same time, the cost of individual microrotations is kept low by the utilization of a fast rotations angle base. key words: CORDIC, vectoring algorithm, oating-point oper-

[1]  Joseph R. Cavallaro,et al.  Efficient implementation of rotation operations for high performance QRD-RLS filtering , 1997, Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors.

[2]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[3]  J.A. Lee,et al.  A fast-rotations based floating point vectoring algorithm , 1999, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461).

[4]  G. J. Hekstra.  CORDIC for High Performance Numerical Computation , 1998 .

[5]  Tomás Lang,et al.  Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD , 1990, IEEE Trans. Computers.

[6]  Jürgen Götze,et al.  An algorithm and architecture based on orthonormal μ-rotations for computing the symmetric EVD , 1995, Integr..

[7]  Ed F. Deprettere,et al.  Floating point Cordic , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.