Implementation of floating-point CORDIC rotation and vectoring based on look up tables and multipliers

A unified design is presented that can execute floating-point CORDIC operations in both rotation and vectoring modes with significantly reduced computation latency. Unlike previous pipelined CORDIC implementations usually requiring a sequence of micro-rotation stages proportional to bit accuracy, the proposed design consists of only two stages, coarse and fine stages, with each stage realized using ROM, adders, and multipliers. The bit-widths of the composing hardware components are also optimized to minimize the cost while maintaining the computation accuracy. The proposed design can be applied to applications that require high-precision arithmetic operations with large data representation ranges, such as 3D graphics acceleration.

[1]  Tomás Lang,et al.  High-throughput CORDIC-based geometry operations for 3D computer graphics , 2005, IEEE Transactions on Computers.

[2]  A.G.M. Strollo,et al.  A 380 MHz Direct Digital Synthesizer/Mixer With Hybrid CORDIC Architecture in 0.25 $\mu{\hbox {m}}$ CMOS , 2007, IEEE Journal of Solid-State Circuits.

[3]  A. Torosyan,et al.  A 300 MHz quadrature direct digital synthesizer/mixer in 0.25 /spl mu/m CMOS , 2002, 2002 IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No.02CH37315).

[4]  Alan N. Willson,et al.  A 400-MHz processor for the conversion of rectangular to polar coordinates in 0.25-μm CMOS , 2003, IEEE J. Solid State Circuits.

[5]  S. Walther.  A unified algorithm for elementary functions , 1899 .

[6]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..