A systolic VLSI architecture for complex SVD
Nariankadu D. Hemkumar, Joseph R. Cavallaro · 2003
A systolic algorithm for the SVD (singular value decomposition) of arbitrary complex matrices based on the cyclic Jacobi method with parallel ordering is presented. A novel two-step, two-sided unitary transformation scheme, tailored to the use of CORDIC (coordinate rotation digital computer) algorithms for high-speed arithmetic, is employed to diagonalize a complex 2*2 matrix. Architecturally, the complex SVD array is modeled on the Brent-Luk-VanLoan array for real SVD. An expandable array of O(n/sup 2/) complex 2*2 matrix processors computes the SVD of an n*n matrix in O(n log n) time. A CORDIC architecture for the complex 2*2 processor with an area complexity twice that of a real 2*2 processor is proposed. Computation time for the complex SVD array is less than three times that for a real SVD array with a similar CORDIC-based implementation.>