|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 78 - Issue 1 |
| Published: September 2013 |
| Authors: K. Sowjanya, Leela Kumari Balivada |
10.5120/13454-1122
|
K. Sowjanya, Leela Kumari Balivada . Design and Performance Analysis of 32 and 64 Point FFT using Multiple Radix Algorithms. International Journal of Computer Applications. 78, 1 (September 2013), 25-29. DOI=10.5120/13454-1122
@article{ 10.5120/13454-1122,
author = { K. Sowjanya,Leela Kumari Balivada },
title = { Design and Performance Analysis of 32 and 64 Point FFT using Multiple Radix Algorithms },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 78 },
number = { 1 },
pages = { 25-29 },
doi = { 10.5120/13454-1122 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A K. Sowjanya
%A Leela Kumari Balivada
%T Design and Performance Analysis of 32 and 64 Point FFT using Multiple Radix Algorithms%T
%J International Journal of Computer Applications
%V 78
%N 1
%P 25-29
%R 10.5120/13454-1122
%I Foundation of Computer Science (FCS), NY, USA
Always technical designers choice includes algorithms, flowcharts, programming etc. , and end users requires the given input and application output. Based upon this view, this paper focus on the advancement of the Fast Fourier Transform (FFT), by doing design and observing the performance analysis of the 32 FFT[1] and 64 point FFT, using Radix-2, Radix-8[17] and Split Radix algorithm. The algorithm is developed by Decimation-In-Time (DIT) of the Fast Fourier Transform (FFT), using VHDL as a design entity and synthesis are performed in Xilinx ISE Design Suite 13. 2 version. Using synthesis results performance analysis is done between 32 and 64 point Fast Fourier Transform (FFT)[16] in terms of speed and computational complexity.