By Topic

Comparison of reconfigurable FFT processor implementation using CORDIC and multipliers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ramesh Bhakthavatchalu ; Dept. of ECE, Amrita Vishwa Vidyapeetham, Amritapuri, Kollam-690525, Kerala, India ; Nisha Abdul Kareem ; J. Arya

In this work, two different methodologies for the implementation of a Fast Fourier transform processor: FFT using CORDIC and FFT using Multiplier are investigated. Reconfigurable FFT using radix-2 Decimation in frequency technique is chosen for the comparison. In terms of area and power, both the implementations were analyzed. Coordinate Rotation Digital Computer (CORDIC) is widely used in DSP applications. It utilizes only add and shift operations instead of multipliers. Both CORDIC and multiplier are employed here for twiddle factor multiplication. The experimental result shows that the multiplier based FFT implementation has lower area and power consumption, as compared to CORDIC based implementation.

Published in:

Recent Advances in Intelligent Computational Systems (RAICS), 2011 IEEE

Date of Conference:

22-24 Sept. 2011