Split-radix Fast Fourier Transform (SRFFT) approximates the minimum number of multiplications by theory among all the FFT algorithms. Since multiplications significantly contribute to the overall system power consumption, SRFFT is a good candidate for implementation of a low power FFT processor. In this paper we present a novel low power SRFFT processor using a modified radix-2 butterfly structure. With the proposed butterfly unit, the address generation scheme for conventional radix-2 FFT could be applied to SRFFT and therefore it can avoid the complexity of address generation and interim data registers. Simulation results show that compared with a conventional radix-2 implementation, power consumption of the new processor is reduced by an amount of 11.7% and 18.3% for 16-point and 32-point FFT respectively.
[1]
G.S. Moschytz,et al.
Practical fast 1-D DCT algorithms with 11 multiplications
,
1989,
International Conference on Acoustics, Speech, and Signal Processing,.
[2]
Marshall C. Pease,et al.
Organization of Large Scale Fourier Processors
,
1969,
J. ACM.
[3]
P. Duhamel,et al.
`Split radix' FFT algorithm
,
1984
.
[4]
Erdal Oruklu,et al.
An Efficient FFT Engine With Reduced Addressing Logic
,
2008,
IEEE Transactions on Circuits and Systems II: Express Briefs.
[5]
J. Tukey,et al.
An algorithm for the machine calculation of complex Fourier series
,
1965
.