Abstract
The idea of approximate rotations has been introduced by J. Götze and G. Hekstra. G. Hekstra and E. Deprettere extended the concept to orthogonal fast rotations and formalized the concept by providing a fast rotation theory. In this theory, the emphasish as been on fast rotation, whereas fast rotation-based vectorization has only been considered in an approximating sense in examples published by J. Götze and G. Hekstra. The formalization of fast rotation-based vectorization is the subject of this paper. The few known approximate fast vectorization algorithms are special cases of the generic fast rotation-based vectorization algorithm proposed in this paper.
Similar content being viewed by others
References
J. Volder, “The CORDIC Trigonometric Computing Technique,” IRE Transactions on Electronic Computers, vol. EC-8 no.3, 1959, pp. 330–334.
G.J. Hekstra and E.F. Deprettere, “Fast Rotations: Low Cost Arithmetic Methods for Orthonormal Rotation,” in T. Lang, J.-M. Muller, and N. Takagi (Eds.), Proceedings of the 13th Symposium on Computer Arithmetic, pp. 116–125.
J. Ma, K.K. Parhi, and E.F. Deprettere, “Implementations of CORDIC Based IIR Digital Filters Using Fast Orthonormal Micro-rotations,” in Proc. of the SPIE: Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, San Diego, CA, 1998.
G. Hekstra, E. Deprettere, M. Monari, and R. Heusdens, “Recursive Approximate Realization of Image Transforms with Orthonormal Rotations,” in B. Mertzios and P. Liatsis (Eds.), Proceedings IWISP'96, Manchester, pp. 525–530.
G. Hekstra, “CORDIC for High Performance Numerical Computation,” PhD Thesis, Delft University of Technology, The Netherlands, 1998.
J. Götze and G. Hekstra, “An Algorithm and Architecture Based on Orthonormal μ-Rotations for Computing the Symmetric EVD,” Integration, the VLSI Journal, vol. 20, 1995, pp. 21–39.
B. Haller, J. Götze, and J. Cavallaro, “Efficient Implementation of Rotation Operations for High Performance and QRD-RLS Filtering,” in IEEE Internationl Conference on Application Specific Systems, Architectures, and Processors, Zürich, Switzerland, 1997, pp. 162–174.
I. Koren, Computer Arithmetic Algorithms, Prentice-Hall, 1993.
G.J. Hekstra and E.F. Deprettere, “Floating Point CORDIC,” in Proceedings 11th Symposium on Computer Arithmetic,Windsor, Ontario, pp. 130–137.
K. van derKolk, J. Lee, and E. Deprettere, “Proving Termination of a Fast Rotations Based Floating Point Vectoring Algorithm,” Technical Report, Delft University of Technology.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van der Kolk, K., Lee, J. & Deprettere, E. A Floating Point Vectoring Algorithm Based on Fast Rotations. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 25, 125–139 (2000). https://doi.org/10.1023/A:1008166822333
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1008166822333