Evaluation of CORDIC algorithms for FPGA design

Javier Valls, Martin Kuhlmann, Keshab K. Parhi

Research output: Contribution to journalArticlepeer-review

57 Scopus citations

Abstract

This paper presents a study of the suitability for FPGA design of full custom based CORDIC implementations. Since all these methods are based on redundant arithmetic, the FPGA implementation of the required operators to perform the different CORDIC methods has been evaluated. Efficient mappings on FPGA have been performed leading to the fastest implementations. It is concluded that the redundant arithmetic operators require a 4 to 5 times larger area than the conventional architecture and the speed advantages of the full custom design has been lost. That is due to the longer routing delays caused by the increase of the fan-out and the number of nets. Therefore, the redundant arithmetic based CORDIC methods are not suitable for FPGA implementation, and the conventional two's complement architecture leads to the best performance.

Original languageEnglish (US)
Pages (from-to)207-222
Number of pages16
JournalJournal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
Volume32
Issue number3
DOIs
StatePublished - Nov 2002

Keywords

  • CORDIC
  • FPGA
  • Redundant arithmetic
  • Two's complement

Fingerprint Dive into the research topics of 'Evaluation of CORDIC algorithms for FPGA design'. Together they form a unique fingerprint.

Cite this