DocumentCode
1605900
Title
A fast-rotations based floating point vectoring algorithm
Author
van der Kolk, K.J. ; Lee, J.A. ; Deprettere, E.F.A.
Author_Institution
Dept. of Inf. Technol. & Syst., Delft Univ. of Technol., Netherlands
fYear
1999
fDate
6/21/1905 12:00:00 AM
Firstpage
231
Lastpage
240
Abstract
The idea of approximate rotations has been introduced by J. Gotze 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 emphasis has been on fast rotation, whereas fast rotation-based vectorization has only been considered in an approximating sense in examples published by J. Gotze 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
Keywords
floating point arithmetic; approximate rotations; fast rotation theory; fast-rotations based floating point vectoring algorithm; orthogonal fast rotations; rotation-based vectorization; Arithmetic; Cities and towns; Computer science; Costs; Delay; Fast Fourier transforms; Feedback loop; Information technology; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Systems, 1999. SiPS 99. 1999 IEEE Workshop on
Conference_Location
Taipei
ISSN
1520-6130
Print_ISBN
0-7803-5650-0
Type
conf
DOI
10.1109/SIPS.1999.822328
Filename
822328
Link To Document