Fast CORDIC algorithm based on a novel angle recoding scheme

Jen Chuan Chih*, Sau-Gee Chen

*Corresponding author for this work

Research output: Contribution to journalConference article

6 Scopus citations


This work proposes a new CORDIC algorithm, which considerably reduces rotation number. It is achieved by combining several design techniques. Particularly, a new angle receding scheme for table lookup is developed to speed up the convergence rate of the rotation angle. The required lookup table is small. Other design techniques used include: the leading-one bit detection, the variable-scale-factor compensation algorithm. The number of the shift-and-add operations required in the compensation algorithm can be also further reduced by using the same residue receding scheme. Simulations show that in average the new design needs only 3.5 iterations to generate results with 22-bit precision, which is much less than the existing designs (normally need 22 iterations). The new encoding scheme can be applied to other iterative convergence computation function such as division operation.

Original languageEnglish
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - 1 Jan 2000
EventProceedings of the IEEE 2000 Internaitonal Symposium on Circuits and Systems - Geneva, Switz
Duration: 28 May 200031 May 2000

Fingerprint Dive into the research topics of 'Fast CORDIC algorithm based on a novel angle recoding scheme'. Together they form a unique fingerprint.

  • Cite this