Enhanced CORDIC Based Rotator Design for Sinusoidal Transforms
Trivedi Pratik1, Zaveri Tanish2
1Pratik Trivedi*, Electronics and Communication engineering department, Institute of Technology, Nirma University, Ahmedabad, India
2Zaveri Tanish, Electronics and Communication engineering department, Institute of Technology, Nirma University, Ahmedabad, India.
Manuscript received on February 01, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 1001-1004 | Volume-9 Issue-3, February, 2020. | Retrieval Number: C4725029320/2020©BEIESP | DOI: 10.35940/ijeat.C4725.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Transforms play an important role in conversion of information from one domain to the other. To be more specific transforms like Discrete Fourier transform (DFT) and Discrete Cosine transform (DCT) helps us to migrate from one time domain to frequency domain based on the basis function selected. The basis function of the every sinusoidal transform carries out a circular rotation to convert information from one domain to the other. There are applications related to communication which requires this rotation into the hyperbolic trajectory as well. Multiplierless algorithm like CORDIC improves the latency of the transforms by eliminating the number of multipliers in the basis function. In this paper we have designed and implemented enhanced version of CORDIC based Rotator design. The Enhanced version is simulated for order 1 to order 36 to emphasize on the results of the proposed algorithm. Results shows that the enhanced CORDIC rotator design surpasses the Mean square error after the order 18 compared to standard CORDIC. Unified CORDIC also can be implemented using the said algorithm to implement different three trajectories.
Keywords: CORDIC, DCT, DFT.