Abstract
This paper presents a study of the efficient mapping on FPGA of the operators required to implement redundant arithmetic based CORDIC algorithms. It is shown that the redundant arithmetic operators require a 4 to 5 times larger area than the conventional ones. On the other hand, the speed advantages of the full-custom design has been lost, due to the longer routing delays caused by the increase of the fanout and the number of nets in the implementation of the redundant operators. Therefore, it is concluded that redundant arithmetic-based CORDIC methods are not suitable for implementation on FPGA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
