• DocumentCode
    1269897
  • Title

    Polynomial transform fast Hartley transform

  • Author

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

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong
  • Volume
    26
  • Issue
    22
  • fYear
    1990
  • Firstpage
    1914
  • Lastpage
    1916
  • Abstract
    A fast algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) based on the polynomial transform is presented. Using a simple relation between the discrete Fourier transform (DFT), and the DHT it is found that the 2D-DHT can be mapped, by means of the polynomial transform, to a number of one-dimension type III discrete W transforms (DWT-III). An improved fast algorithm for computing the DWT-III is also proposed.
  • Keywords
    polynomials; transforms; DFT; DHT; discrete Fourier transform; fast algorithm; one-dimension type III discrete W transforms; polynomial transform; two-dimensional discrete Hartley transform;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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