• DocumentCode
    990541
  • Title

    `Split radix´ FFT algorithm

  • Author

    Duhamel, Pierre ; Hollmann, H.

  • Author_Institution
    CNET/PAB/RPE, Issy-les-Moulineaux, France
  • Volume
    20
  • Issue
    1
  • fYear
    1984
  • Firstpage
    14
  • Lastpage
    16
  • Abstract
    A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the Raderi-Brenner algorithm, but much fewer additions, and is numerically better conditioned, and is performed `in place´ by a repetitive use of a `butterfly´-type structure.
  • Keywords
    fast Fourier transforms; FFT; additions; butterfly-type structure; fast Fourier transform algorithm; multiplications;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19840012
  • Filename
    4248564
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=990541