Redundant constant-factor implementation of multi-dimensional CORDIC and its application to complex SVD

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