Hardware efficient architectures for eigenvalue computation

Authors:
Yang Liu;Christos-Savvas Bouganis;Peter Y. K. Cheung;Philip H. W. Leong;Stephen J. Motley
Affiliations:
Imperial College, London;Imperial College, London;Imperial College, London;Imperial College, London;Imperial College, London
Venue:
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Year:
2006

Citing 2
Cited 1

A method for calculation of the square root using combinatorial logic

Journal of VLSI Signal Processing Systems
An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation

IEEE Transactions on Computers

A high throughput FPGA-Based implementation of the lanczos method for the symmetric extremal eigenvalue problem

ARC'12 Proceedings of the 8th international conference on Reconfigurable Computing: architectures, tools and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Eigenvalue computation is essential in many fields of science and engineering. For high performance and real-time applications, this may need to be done in hardware. This paper focuses on the exploration of hardware architectures which compute eigenvalues of symmetric matrices. We propose to use the Approximate Jacobi Method for general case symmetric matrix eigenvalue problem. The paper illustrates that the proposed architecture is more efficient than previous architectures reported in the literature. Moreover, for the special case of 3 x 3 symmetric matrices, we propose to use an Algebraic Method. It is shown that the pipelined architecture based on the Algebraic Method has a significant advantage in terms of area.