Efficient complex matrix transformations with CORDIC

A two-sided unitary transformation (Q transformation) structured to permit integrated evaluation and application using CORDIC primitives is introduced. The Q transformation is shown to be useful as an atomic operation in parallel arrays for computing the eigenvalue/singular value decomposition of Hermitian/arbitrary matrices, and three specific Q transformations that are needed in such arrays are identified. Issues related to the use of CORDIC for complex arithmetic are addressed, and implementations in both conventional (nonredundant) CORDIC and redundant and online modifications to CORDIC are described. If the time to compute a CORDIC operation in nonredundant CORDIC is T_c, the Q transformations identified here can be evaluated and/or applied in 2T _c using four CORDIC modules for maximum concurrency. In either case, 0.5 T_c is required to account for scale factor correction. It is shown that a Q transformation can be evaluated and/or applied in ≈10n, where n is the desired bit-precision