Fast Fourier Transform (FFT) is a most proficient algorithm for computing the Discrete Fourier Transform (DFT). FFT is specially used in analysis of autocorrelation, disambiguation, recognition of patterns, statistics and data analysis. The new proposed algorithm for computing a length L=2 B x3 C FFT. It is used to minimize the twist of hardware depict and arithmetic operations. Additionally, the propound fragment design can accomplish by the mixer of radix-3 and radix-2 B x3 C FFT algorithm. It is entirely changeable of Split Radix Fast Fourier Transform (SRFFT) algorithm. As a consequence, the new proffer design of length L is used to belittle the area of system on chips and mathematical calculation. More compromise can achieve by combining the two architectures implemented in the same FFT. It naturally furnishes a broad selection of accessible length of FFT’s.

S Karthick

Papers

Area minimized fft architecture using split radix algorithm for length l=radix-3 and radix-2bx3c