Modified CORDIC Algorithm and Its Implementation Based on FPGA
Huan Li, Yan Xin
Abstract
Huan Li, Yan Xin
Abstract
In conventional CORDIC algorithm, multiplier and a lookup table are needed to achieve calculation of multiple transcendental function, which will lead to hardware circuit complexity and lower operation speed. Aim at overcoming the shortcomings of traditional CORDIC algorithm, a modified CORDIC algorithm is proposed and implemented by FPGA program. The method does not need the module of correction factor and the lookup table, and just needs a simple shift and add-subtract to achieve the calculation of multiple transcendental function. So it can reduce hardware costs and improve operational performance.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In conventional CORDIC algorithm, multiplier and a lookup table are needed to achieve calculation of multiple transcendental function, which will lead to hardware circuit complexity and lower operation speed. Aim at overcoming the shortcomings of traditional CORDIC algorithm, a modified CORDIC algorithm is proposed and implemented by FPGA program. The method does not need the module of correction factor and the lookup table, and just needs a simple shift and add-subtract to achieve the calculation of multiple transcendental function. So it can reduce hardware costs and improve operational performance.
Key concepts: CORDIC, Lookup table, Field-programmable gate array, Transcendental function, Computer science, Algorithm, Multiplier (economics), Table (database)