DocumentCode :
745768
Title :
Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
Author :
Frigo, M. ; Johnson, Steven G.
Author_Institution :
IBM Austin Res. Lab., TX
Volume :
55
Issue :
4
fYear :
2007
fDate :
4/1/2007 12:00:00 AM
Firstpage :
1547
Lastpage :
1548
Abstract :
The paper "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms" (in IEEE Transactions on Signal Processing, vol. 48, no. 1, pp. 172-183, January 2000) presents a novel "paired transform" fast Fourier transform (FFT) algorithm that is claimed to require fewer total real additions and multiplications than previous algorithms. We show this claim to be false: although the algorithm correctly computes the discrete Fourier transform, an accurate count shows that it requires more real-arithmetic operations than pre-existing FFTs
Keywords :
Hadamard transforms; fast Fourier transforms; FFT; Hadamard transforms; fast Fourier transforms; split manageable efficient algorithm; Communication system control; Difference equations; Differential algebraic equations; Discrete Fourier transforms; Fast Fourier transforms; Nonlinear filters; Riccati equations; Signal processing algorithms; Smoothing methods; Stochastic processes; Algorithms; complexity theory; discrete Fourier transforms;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2006.889087
Filename :
4133031
Link To Document :
بازگشت