• DocumentCode
    1007748
  • Title

    Fast Hartley transform algorithm

  • Author

    Meckelburg, H.-J. ; Lipka, D.

  • Author_Institution
    Ruhr-Universitÿt Bochum, Institut fÿr Hoch- und Höchstfrequenztechnik, Bochum, West Germany
  • Volume
    21
  • Issue
    8
  • fYear
    1985
  • Firstpage
    341
  • Lastpage
    343
  • Abstract
    The discrete Hartley transform is a new tool for the analysis, design and implementation of digital signal processing algorithms and systems. It is strictly symmetrical concerning the transformation and its inverse. A new fast Hartley transform algorithm has been developed. Applied to real signals, it is faster than a real fast Fourier transform, especially in the case of the inverse transformation. The speed of operation for a fast convolution can thus be increased.
  • Keywords
    signal processing; transforms; convolution; digital signal processing; fast Hartley transform algorithm; inverse transformation; real signals;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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