Abstract

In this work we develop a generalization of the CORDIC algorithm for any radix in three coordinate systems, linear, circular and hyperbolic. We carry out a comparative study between different radixes at the number of additions level, due to the fact that the complexity in additions determines the total hardware associated with the implementation of the algorithm. Radix 4 minimizes the number of additions, therefore we propose a high speed CORDIC processor based on this radix 4. We have developed new criteria for the vectorization and rotation modes and we introduce a new technique for the compensation of a non-constant scale factor, multifactor compensation. The processor we propose is of a general and pipelined character and uses reductant arithmetic (signed digit) in order to reduce the delay in each stage, parallelizing the operation of the adders using a competitive implementation (reduction of the number of stages) with respect to radix 2 implementations which have recently appeared in the literature.

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 call

Disclaimer: 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.