• DocumentCode
    997674
  • Title

    Fast algorithm for computer complex number-theoretic transforms

  • Author

    Reed, I.S. ; Liu, K.Y. ; Truong, T.K.

  • Author_Institution
    University of Southern California, Department of Electrical Engineering, Los Angeles, USA
  • Volume
    13
  • Issue
    10
  • fYear
    1977
  • Firstpage
    278
  • Lastpage
    280
  • Abstract
    A high-radix f.f.t. algorithm for computing transforms over GF(q2), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional f.f.t.
  • Keywords
    fast Fourier transforms; number theory; circular convolutions; complex number theoretic transforms; high radix fast Fourier transform algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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