Optimizing scaling factor computations in flat cordic

In CORDIC algorithm, where each micro-rotation (iteration) is realized by a shift and an add/subtract operation, a scaling operation on the resultant vector becomes necessary. In FLAT CORDIC, the CORDIC iterations axe combined to form a single equation, which is expressed in terms of the initial vector.(3) In this paper, a constructive method to attain a good scaling factor for FLAT CORDIC, by manipulating the basic FLAT CORDIC iterations, is proposed. The proposed method does not lead to an increase in the number of terms of the generalized FLAT CORDIC equation to an unacceptable level. Since the scaling factor computation is one of the major bottlenecks in the entire CORDIC procedure, the proposed method can be effectively used to speed up the FLAT CORDIC operation. The method employed to achieve a good scaling factor is explained in detail with the help of a suitable example.