HCORDIC: A high-radix adaptive CORDIC algorithm

We propose a new high-radix adaptive CORDIC algorithm (HCORDIC) which is free from all the drawbacks associated with the basic CORDIC algorithm. HCORDIC requires fewer iterations, produces less computational noire, and can directly evaluate double the number of elementary functions calculated by CORDIC. HCORDIC requires the availability of a parallel multiplier and look-up tables. These requirements are easily accommodated by new microprocessor chips having on-chip memory and a parallel multiplier. Extensive numerical simulation results have been performed which clearly show me superiority of the proposed algorithm. The results were obtained for a 32-bit floating-point data format. Similar improvements could be observed in other number representations.