Evaluation of fast rotation methods
In this paper, we present a comprehensive inventory and evaluation of fast rotation methods. Fast rotations are arithmetic methods for performing orthonormal rotation at a very low cost in implementation. We show that there are different implementation forms for fast rotations, and propose a classif...
Saved in:
| Published in | Journal of VLSI signal processing Vol. 25; no. 2; pp. 113 - 124 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
01.06.2000
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | In this paper, we present a comprehensive inventory and evaluation of fast rotation methods. Fast rotations are arithmetic methods for performing orthonormal rotation at a very low cost in implementation. We show that there are different implementation forms for fast rotations, and propose a classification for them. We compare fast rotation methods with a direct form and with a factored form implementation, and examine the trade-offs that exist between the angle of rotation, the accuracy in scaling, and the cost of performing the rotation. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0922-5773 |
| DOI: | 10.1023/A:1008114805495 |