Open AccessA 2048-point Split-Radix Fast Fourier Transform Computed using Radix-4 Butterfly Units
Author(s) -
Sonali D. Patil*,
Manish Sharma
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b2690.118419
Subject(s) - fast fourier transform , radix (gastropod) , split radix fft algorithm , prime factor fft algorithm , rader's fft algorithm , signal flow graph , computer science , cooley–tukey fft algorithm , algorithm , arithmetic , mathematics , parallel computing , fourier transform , fourier analysis , short time fourier transform , engineering , mathematical analysis , botany , electrical engineering , biology
For the low-power consumption of fast fourier transform, Split-radix fast Fourier transforms are widely used. SRFFT uses less number of mathematical calculations amongst the different FFT algorithms. Split-radix FFT has the same signal flow graph that of conventional radix-2/4 FFT’s. Therefore, the address generation method is same for SRFFT as of radix-2. A low power SRFFT architecture with modified butterfly units is presented over here. Here, it is shown that the, a 2048-point SRFFT is computed using radix-4 butterfly unist. Dynamic power is saved, on compromising the use of extra hardware. Here, the architecture size is increased from radix-2 to 4 and the dynamic power consumption is evaluated.