Skip to main content
SpringerLink
Log in

Evaluation of Fast Rotation Methods

  • Published:
Journal of VLSI signal processing systems for signal, image and video technology Aims and scope Submit manuscript

Abstract

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 existbetween the angle of rotation, the accuracy in scaling, and the cost of performing the rotation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Hekstra, “Definition and structure of hemisphere and viewing rays,” Technical Report ET/NT/Radio-9, TU Delft, The Netherlands, 1993.

    Google Scholar 

  2. J.E. Volder, “The CORDIC Trigonometric Computing Technique,” IRE Transactions on Electronic Computers 1959, pp. 330–334.

  3. J. Walther, “A Unified Algorithm for Elementary Functions,” in Proceedings of the AFIPS Spring Joint Computer Conference 1971, pp. 379–385.

  4. R. Reitwiesner, “Binary Arithmetic,” Advances in Computers, vol. 1, 1966, pp. 231–308.

    Article  Google Scholar 

  5. H. Samueli, “An Improved Search Algorithm for the Design of Multiplier-Less FIR Filters with Power-of-Two Coefficients,” IEEE Trans. on Circuits and Systems, vol. 36, 1989, pp. 1044–1047.

    Article  Google Scholar 

  6. D. Li, J. Song, and Y.C. Lim, “A Polynomial-Time Algorithm for Designing Digital Filters with Power-of-two Coefficients,” in Proceedings of 1993 IEEE ISCAS. Chicago, Il, 1993, pp. 84–87.

  7. D.A. Parker and K.K. Parhi, “Area-Efficient Parallel FIR Digital Filter Implementations,” in International Conference on Applications-Specific Systems, Architectures and Processors, Chicago, IL, 1996, pp. 93–111.

  8. D.A. Magenheimer, L. Peters, K.W. Petis, and D. Zuras, “Integer Multiplication and Division on the HP Precision Architecture,” IEEE Transactions on Computers, vol. 37, 1988, pp. 980–990.

    Article  Google Scholar 

  9. J. Götze, S. Paul, and M. Sauer, “An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation. ” IEEE Trans. Comput., vol. 42, 1993, pp. 1058–1065.

    Article  MathSciNet  Google Scholar 

  10. G.J. Hekstra and E.F. Deprettere, “Fast Rotations: Low-Cost Arithmetic Methods for Orthonormal Rotation,” in Proceedings of the 13th Symposium on Computer Arithmetic, T. Lang, J.-M. Muller, and N. Takagi (Eds.), 1997, pp. 116–125.

  11. J. Götze and G.J. Hekstra, “Adaptive Approximate Rotations for Computing the EVD,” in Proceedings 3rd Int. Workshop on Algorithms and Parallel VLSI Architectures, Leuven, 1994.

  12. 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.

    Article  MATH  Google Scholar 

  13. J. Götze and G. Hekstra, “Adaptive Approximate Rotations for Computing the Symmetric EVD,” in Algorithms and Parallel VLSI Architectures III. M. Moonen and F. Catthoor (Eds.), Elsevier, 1995, pp. 73–84.

  14. G.J. Hekstra, E.F. Deprettere, R. Heusdens, and M. Monari, “Recursive Approximate Realization of Image Transforms with Orthonormal Rotations,” in Proceedings International Workshop on Image and Signal Processing, Manchester, UK, 1996a.

  15. G.J. Hekstra, E.F. Deprettere, R. Heusdens, and Z. Zeng, “Efficient Orthogonal Realization of Image Transforms,” in Proceedings SPIE, Denver, Colorado, US, 1996b.

  16. G.J. Hekstra, “CORDICfor High-Performance Numerical Computation,” Ph.D. Thesis, Technical University of Delft, The Netherlands, 1998.

    Google Scholar 

  17. J. Götze, “CORDIC-Based Approximate Rotations for SVD and QRD,” in European Signal Processing Conference, Edinburgh, Scotland, 1994, pp. 1867–1871.

  18. J. Götze, P. Rieder, and J. Nossek, “Parallel SVD-Updating Using Approximate Rotations,” in SPIE Conference on Advanced Signal Processing: Algorithms and Applications, San Diego, USA, 1995, pp. 242–252.

  19. P. Rieder, J. Götze, M. Sauer, and J. Nossek, “Orthogonal Approximation of the Discrete Cosine Transform,” in Proc. European Conference on Circuit Theory and Design, Istanbul, Turkey, 1995, pp. 1003–1006.

Download references

Author information

Authors and Affiliations

  1. Philips Research Labs, Eindhoven, The Netherlands

    Gerben Hekstra

Authors
  1. Gerben Hekstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hekstra, G. Evaluation of Fast Rotation Methods. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 25, 113–124 (2000). https://doi.org/10.1023/A:1008114805495

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008114805495

Keywords

Search

Navigation