The Community for Technology Leaders
Green Image
<p>Two-sided unitary transformations of arbitrary 2/spl times/2 matrices are needed in parallel algorithms based on Jacobi-like methods for eigenvalue and singular value decompositions of complex matrices. This paper presents a two-sided unitary transformation structured to facilitate the integrated evaluation of parameters and application of the typically required transformations using only the primitives afforded by CORDIC; thus enabling significant speedup in the computation of these transformations on special-purpose processor array architectures implementing Jacobi-like algorithms. We discuss implementation in (nonredundant) CORDIC to motivate and lead up to implementation in the redundant and on-line enhancements to CORDIC. Both variable and constant scale factor redundant (CFR) CORDIC approaches are detailed and it is shown that the transformations may be computed in 10n+/spl delta/ time, where n is the data precision in bits and /spl delta/ is a constant accounting for accumulated on-line delays. A more area-intensive approach using a novel on-line CORDIC encoded angle summation/difference scheme reduces computation time to 6n+/spl delta/. The area/time complexities involved in the various approaches are detailed.</p>
parallel algorithms; matrix algebra; eigenvalues and eigenfunctions; special purpose computers; parallel architectures; computational complexity; digital arithmetic; CORDIC; unitary transformations; two-sided unitary transformation; matrices; parallel algorithms; Jacobi-like methods; eigenvalue; singular value decompositions; complex matrices; special-purpose processor array architectures; nonredundant CORDIC; online CORDIC; redundant CORDIC; Coordinate Rotation Digital Computer.

N. Hemkumar and J. Cavallaro, "Redundant and On-Line CORDIC for Unitary Transformations," in IEEE Transactions on Computers, vol. 43, no. , pp. 941-954, 1994.
86 ms
(Ver 3.3 (11022016))