Redundant Constant-Factor Implementation of Multi-Dimensional CORDIC andIts Application to Complex SVD

Abstract

Redundant Implementations of Multi-dimensional CORDIC algorithms are presented where the carry-ripple additions are replaced by carry-free signed-digit additions. Both folded (iterative) and unfolded (pipelined) architectures are considered in the redundant implementation. Furthermore, the scaling iterations are merged with the unscaled CORDIC iterations in the folded CORDIC architecture in order to reduce the overall computation time of one CORDIC operation. The redundant multidimensional CORDIC is then applied to the singular value decomposition of complex matrices, with either a folded or an on-line architecture. The resulting processing speed is higher than with alternative approaches based on 2-D CORDIC.