A systolic algorithm for cyclic-by-rows SVD

Uwe Schwiegelshohn, Lothar Thiele

Abstract: This paper presents an algorithm which is essentially equivalent to Jacobi-type algorithms with a cyclic-by-rows iteration scheme but also enables a fast parallel and systolic computation. Further, a comparison with other parallel algorithms for the same problem is provided. At last a systolic array is derived which requires (n+1) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> /4 processor cells and has a time complexity of O(n) for each sweep.