• DocumentCode
    1089112
  • Title

    An introduction to programming the Winograd Fourier transform algorithm (WFTA)

  • Author

    Silverman, Harvey F.

  • Author_Institution
    IBM Thomas J. Watson Research Center, Yorktown Heights, NY
  • Volume
    25
  • Issue
    2
  • fYear
    1977
  • fDate
    4/1/1977 12:00:00 AM
  • Firstpage
    152
  • Lastpage
    165
  • Abstract
    Recently, Dr. Shmuel Winograd discovered a new approach to the computation of the discrete Fourier transform (DFT). Relative to fast Fourier transform (FFT), the Winograd Fourier transform algorithm (WFTA) significantly reduces the number of multiplication operations; it does not increase the number of addition operations in many cases. This paper introduces the new algorithm and discusses the operations comparison problem. A guide for programming is included, as are some preliminary running times.
  • Keywords
    Discrete Fourier transforms; Equations; Fast Fourier transforms; Fourier transforms; Matrix decomposition; Timing;
  • fLanguage
    English
  • Journal_Title
    Acoustics, Speech and Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/TASSP.1977.1162924
  • Filename
    1162924
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1089112