A Floating Point Vectoring Algorithm Based on Fast Rotations

Authors:
K. J. Van Der Kolk;J. A. Lee;E. F. A. Deprettere
Affiliations:
Delft University of Technology, Department of Information Technology and Systems, Mekelweg 4, 2628 CD Delft, The Netherlands;Chosun University, Department of Computer Science, SeoSukDong 375, DongGu, Kwang-Ju City 501-759, Korea;Delft University of Technology, Department of Information Technology and Systems, Mekelweg 4, 2628 CD Delft, The Netherlands
Venue:
Journal of VLSI Signal Processing Systems - special issue on CORDIC
Year:
2000

Citing 4
Cited 0

Computer arithmetic algorithms

Computer arithmetic algorithms
An algorithm and architecture based on orthonormal &mgr;-rotations for computing the symmetric EVD

Integration, the VLSI Journal - Special issue: algorithms and parallel VLSI architectures
Efficient Implementation of Rotation Operations for High Performance QRD-RLS Filtering

ASAP '97 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures and Processors
Fast Rotations: Low-cost Arithmetic Methods for Orthonormal Rotation

ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)

Quantified Score

Hi-index	0.00

Visualization

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.