• DocumentCode
    3784692
  • Title

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

  • Author

    R. Stasinski

  • Author_Institution
    Politechniki Poznanskiej, Piotrowo, Poznan Poland
  • Volume
    32
  • Issue
    6
  • fYear
    1984
  • Firstpage
    1255
  • Lastpage
    1257
  • Abstract
    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.
  • Keywords
    "Signal processing algorithms","Registers","Fast Fourier transforms","Error correction","Speech","Inspection","Discrete Fourier transforms","High performance computing","Filling","Acoustics"
  • Journal_Title
    IEEE Transactions on Acoustics, Speech, and Signal Processing
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/TASSP.1984.1164448
  • Filename
    1164448