• DocumentCode
    995532
  • Title

    Fast biased polynomial transforms for 2D prime length discrete Fourier transforms

  • Author

    Wu, Ja-Ling ; Pei, Soo-Chang

  • Author_Institution
    Tatung Institute of Technology, Department of Electrical Engineering, Taipei, Republic of China
  • Volume
    20
  • Issue
    22
  • fYear
    1984
  • Firstpage
    933
  • Lastpage
    934
  • Abstract
    The fast biased polynomial transform (FBPT) is defined directly over a ZN ¿ 1 ring instead of the conventional cyclotomic polynomial rings. For N prime, these FBPTs can be used for the efficient evaluation of the 2D prime length DFT.
  • Keywords
    fast Fourier transforms; polynomials; 2D prime length DFT; FBPTs; discrete Fourier transforms; fast biased polynomial transform;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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