Skip to main content
Log in

Bit-level systolic algorithms for real symmetric and Hermitian eigenvalue problems

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

Abstract

Arithmetic algorithms are presented that speed up the parallel Jacobi method for the eigen-decomposition of real symmetric and complex Hermitian matrices. The 2×2 submatrices to which the Jacobi rotations are applied form a Clifford algebra, hence they can be decomposed into a sum of even and odd part. This decomposition enables the application of the rotations from a single side instead of both, thus removing some sequentiality from the original Jacobi method. Moreover, with the help of implicit CORDIC algorithms, the rotations are evaluated and applied in a fully concurrent fashion on triangular arrays of specialized processors. The CORDIC algorithms employed in the complex case are genuine 3- and 4-dimensional generalizations of the 2-dimensional algorithm used in the real case. Because these algorithms are implicit, variants are obtained with minor modifications that perform rotations whose resolution is poor at first and slowly increases to become high in the last steps of the Jacobi method. Such variants further reduce the total computation time.

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

Access this article

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. J.H. Wilkinson,The Algebraic Eigenvalue Problem, New York: Oxford University Press, 1965.

    MATH  Google Scholar 

  2. R.P. Brent and F.T. Luk, “The Solution of Singular Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays,”SIAM J. Sci. Statist. Comput., vol. 6, 1985, pp. 69–84.

    Article  MathSciNet  MATH  Google Scholar 

  3. A. Arjomand, Fast Parallel Computation of the Singular Value Decomposition of Real Matrices Using CORDIC Arithmetic, Ph.D. Dissertation, Department of Electrical Engineering, Yale University, 1992.

  4. J.E. Volder, “The CORDIC Trigonometric Computing Technique,”IRE Trans. on Electronic Computers, vol. EC-8, 1959, pp. 330–334.

    Article  Google Scholar 

  5. B. Yang and J.F. Böhme, “Reducing the Computations of the SVD Array Given by Brent and Luk,”Adv. Algor. & Arch. for Sig. Proc. IV. Proc. SPIE, vol. 1152, 1989, pp. 92–102.

    Google Scholar 

  6. M.D. Ercegovac and T. Lang, “Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD,”IEEE Trans. on Computers, vol. 39, 1990, pp. 725–740.

    Article  Google Scholar 

  7. J.J. Modi and J.D. Pryce, “Efficient Implementation of Jacobi's Diagonalization Method on the DAP,”Numer. Math., vol 46, 1985, pp. 443–454.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Davio, J.-P. Deschamps and A. Thayse,Digital Systems, New York: Wiley, 1983.

    MATH  Google Scholar 

  9. G.R. Gao and S.J. Thomas, “An Optimal Parallel Jacobi-Like Solution Method for the Singular Value Decomposition,”Proc. 1988 Int. Conf. on Parallel Processing, vol. III, 1988, pp. 47–53.

    Google Scholar 

  10. J.-M. Delosme, “Parallel Implementations of the SVD Using Implicit CORDIC Arithmetic,” R. Vaccaro, Ed.,SVD and Signal Processing II, Amsterdam: Elsevier Science, 1991, pp. 33–56.

    Google Scholar 

  11. F.R. Harvey,Spinors and Calibrations, Boston: Academic Press, 1990.

    MATH  Google Scholar 

  12. J.-M. Delosme, “A Processor for Two-dimensional Symmetric Eigenvalue and Singular Value Arrays,”Proc. 21st Asilomar Conf. on Circuits. Systems and Computers, 1987, pp. 217–221.

  13. R. Szilard,Theory and Analysis of Plates, Englewood Cliffs, NJ: Prentice-Hall, 1974.

    MATH  Google Scholar 

  14. G. Forsythe and P. Henrici, “The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix,”Trans. AMS, vol. 94, 1960, pp. 1–23.

    Article  MathSciNet  MATH  Google Scholar 

  15. J.-M. Delosme, “Bit-level Systolic Algorithm for the Symmetric Eigenvalue Prollem,”Proc. Int. Conf. on Application Specific Array Processors, 1990, pp. 770–781.

  16. N. Takagi T. Asada and S. Yajima, “A Hardware Algorithm for Computing Sine and Cosine Using Redundant Binary Representation,”Systems and Computers in Japan, vol. 18, 1987, pp. 1–9. (See alsoIEEE Trans. on Computers, vol. 40, 1991, pp. 989–995.)

    Article  MathSciNet  Google Scholar 

  17. J.-M. Delosme, “CORDIC Algorithms: Theory and Extensions,”Adv. Algor. & Arch. for Sig. Proc. IV, Proc. SPIE, vol. 1152, 1989, pp. 131–145.

    Google Scholar 

  18. J.-M. Delosme and S.-F. Hsiao, “CORDIC Algorithms in Four Dimensions,”Adv. Sig. Proc. Algor., Arch. and Impl., Proc. SPIE, vol. 1348, 1990, pp. 349–360.

    Google Scholar 

  19. J.R. Cavallaro and F.T. Luk, “Architectures for a CORDIC SVD Processor,”Real Time Sig. Proc. IX, Proc. SPIE, vol. 698, 1986, pp. 45–53.

    Google Scholar 

  20. A.J. van der Veen and E.F. Deprettere, “A Parallel VLSI Direction Finding Algorithm,”Adv. Algor. & Arch. for Sig. Proc., Proc. SPIE, vol. 975, 1988, pp. 289–299.

    Google Scholar 

  21. J.R. Cavallaro and A.C. Elster, “A CORDIC Processor Array for the SVD of a Complex Matrix,” R. Vaccaro, Ed.,SVD and Signal Processing II, Amsterdam: Elsevier Science, 1991, pp. 227–239.

    Google Scholar 

  22. F.T. Luk and D.E. Schimmel, “A Novel Bit-Level Algorithm for the Symmetric Eigenvalue Problem,” contributed presentation,1989 SIAM Annual Meeting, San Diego, July 1989.

  23. D.E. Schimmel, Bit-level Jacobi-like Algorithms for Eigenvalue and Singular Value Decomposition, Ph.D. Dissertation, Department of Electrical Engineering, Cornell University, Jan. 1991.

  24. I.S. Hwang and A.L. Fisher, “Ultrafast Compact 32-bit CMOS Adders in Multiple-Output Domino Logic,”IEEE J. Solid-State Circuits, vol. 24, 1989, pp. 358–368.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delosme, JM. Bit-level systolic algorithms for real symmetric and Hermitian eigenvalue problems. J VLSI Sign Process Syst Sign Image Video Technol 4, 69–88 (1992). https://doi.org/10.1007/BF00930619

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00930619

Keywords

Navigation