• DocumentCode
    2828304
  • Title

    Polynomial transform fast Hartley transform

  • Author

    Chan, S.C. ; Ho, K.L.

  • Author_Institution
    Dept. of Electron. Eng., City Polytech. of Hong Kong, Hong Kong
  • fYear
    1991
  • fDate
    11-14 Jun 1991
  • Firstpage
    642
  • Abstract
    Fast algorithms for computing the two-dimensional discrete Hartley transform (2D DHT) of length pn×pn, with p a prime number, are presented. Using a simple relation between the two-dimensional discrete Fourier transform (2D DFT) and the 2D DHT, methods for mapping 210 DFT to 1D DFT can be applied to the Hartley transform. Methods for computing the resulting 1D transforms are also discussed
  • Keywords
    fast Fourier transforms; polynomials; transforms; 1D transforms; DFT; DHT; two-dimensional discrete Fourier transform; two-dimensional discrete Hartley transform; Cities and towns; Content addressable storage; Discrete Fourier transforms; Discrete transforms; Discrete wavelet transforms; Fast Fourier transforms; Fourier transforms; Kernel; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1991., IEEE International Sympoisum on
  • Print_ISBN
    0-7803-0050-5
  • Type

    conf

  • DOI
    10.1109/ISCAS.1991.176416
  • Filename
    176416
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2828304