A floating point vectoring algorithm based on fast rotations

Abstract

In this paper we develop a fast CORDIC-based floating-point vectoring algorithm which reduces significantly the amount of microrotation steps as compared to the conventional algorithm. The overhead required to accomplish this is minimized by the introduction of an angle selection function which considers only a few of the total amount of bits used to represent the vector being rotated. At the same time, the cost of individual microrotations is kept low by the utilization of a fast rotations angle base.