Modified CORDIC algorithm for computation of arctangent with variable iterations

In this paper, a modified CORIDC algorithm for computation of arctangent is presented. Unlike the conventional CORDIC algorithm which has constant number of iterations, the proposed algorithm calculates the nearest predefined angle to the input phase at the beginning of every iteration and then rotates by an optimal angle. As it has variable iterations, the novel rotation strategy provides faster convergence speed that reduces the number of iterations with respect to the previous approaches. Further, the performance of the proposed algorithm is improved when compared with that of the conventional one at cost of the same maximum shift number. With a number of simulation experiments, the performance of the proposed algorithm is validated by the numerical results.