Title :
On the efficiency of `A new efficient algorithm to compute the two-dimensional discrete Fourier transform´
Author :
Napolitano, Leonard M., Jr. ; Redinbo, G.Robert
Author_Institution :
Sandia Nat. Lab., Livermore, CA, USA
fDate :
2/1/1992 12:00:00 AM
Abstract :
The commenter suggests that the efficiency claims made by I. Gertner in the above-titled paper (IEEE Trans. Acoust., Speech, Signal Processing, vol.36, no.7, p.1036-50, July 1988), based on a Radon transform for reducing the number of 1-D discrete Fourier transform (DFTs) to compute a 2-D DFT, are offset by a costly increase in the number of additions required to perform the Radon transform. Gertner replies that the algorithm has an efficiency claim based on its parallelization of the 2-D task into smaller independent tasks and on its reduction of the number of DFTs required to complete the calculation
Keywords :
fast Fourier transforms; signal processing; 2-D DFT; Radon transform; efficient algorithm; two-dimensional discrete Fourier transform; Array signal processing; Covariance matrix; Decorrelation; Direction of arrival estimation; Discrete Fourier transforms; Fourier transforms; Multiple signal classification; Signal processing algorithms; Smoothing methods; Speech processing;
Journal_Title :
Signal Processing, IEEE Transactions on
