By Topic

Comments on "Bounds on the minimum number of data transfers in WFTA and FFT programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
R. Stasinski ; Politechniki Poznanskiej, Piotrowo, Poznan Poland

Reference [1] contains corrections to the arithmetical errors of the paper and to the part of the resulting concluding remarks (the concluding remarks concerning 1024-point FFT and 1008- point WFTA remain uncorrected). It seems, however, that the main problem with [1] concerns the fact that the proposed programs are not optimal from the point of view of the number of data transfers. The main limitations of the programs given in [1] are related to the structures of small transforms, as well as to the structures of complete fast Fourier transform algorithms. Some of these limitations are pointed out in the correspondence.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:32 ,  Issue: 6 )