Fixed rotation sequence CORDIC algorithm based on maximum approximation angle

In order to solve the problems of irregular rotation sequence, high complexity and large storage space in traditional CORDIC algorithm, a CORDIC algorithm structure with fixed rotation sequence is designed based on the theory of maximum approximation angle. By analyzing the strategy of binary high bit rotation after angle re-coding, the method of fixed sequence which rotates each bit twice is determined, which reduces the number of judgments of high bit rotation direction and simplifies the calculation of proportional constant. Finally, the experimental comparison and analysis of the optimization algorithm before and after implementation in the FPGA verifies the superiority and effectiveness of the optimized algorithm compared with the traditional algorithm in the aspects of computational complexity, storage space usage and error control.