High-Performance Matrix Eigenvalue Decomposition Using the Parallel Jacobi Algorithm on FPGA

Circuits, Systems, and Signal Processing - Tập 42 - Trang 1573-1592 - 2022
Di Yan1, Wei-Xing Wang1, Xiao-Wei Zhang2
1School of Information Engineering, Chang'an University, Xi'an, Shaanxi, China
2School of Information Engineering, Xijing University, Xi’an Shaanxi, China

Tóm tắt

Field-programmable gate arrays (FPGAs) are one attractive hardware platform for computing the eigenvalue decomposition of low-dimensional symmetric matrices. For this, one popular method is using the parallel Jacobi algorithm based on coordinate rotations digital computer (CORDIC). We here present a novel efficient FPGA architecture for computing the eigenvalue decomposition, whose main idea is from the fact that rotation matrices in Jacobi’s method belong to a category of special sparse matrices. Based on the above characteristic, matrix multiplications in the parallel Jacobi algorithm can be performed by FPGA efficiently. In addition, we provide one solution for Jacobi’s method to decompose the complex Hermitian matrix. Then, our proposed design is compared with state-of-the-arts on one Xilinx XC7V690T FPGA. Due to the high real-time requirement, we finally take the subspace-based direction of arrival (DOA) estimation in wireless communication as an application example.

Tài liệu tham khảo

I. Koseoglu, E. Ozturk, T. Ayhan, M.E. Yalcin, An FPGA implementation of Givens rotation based on digital architecture for computing eigenvalues of asymmetric matrix, in 13-Th Inter. Conf. Elect. & Elect. Engin., Turkey, 1–4 (2021)

M. Shabany, D. Patel, P. Gulak, A low-latency low-power QR decomposition ASIC implementation in 0.13µm CMOS. IEEE Trans. Circuits Syst. I, Reg. Pap. 60(2), 327–340 (2013)

J.E. Volder, The birth of CORDIC. J. VLSI Signal Process. 25, 101–105 (2000)

D.S. Watkins, Fundamentals of matrix computations, 2nd edn. (John Wiely & Sons Inc, New York, 2002)

Xilinx, https://www.xilinx.com