• DocumentCode
    3487814
  • Title

    Efficient computation of discrete Hartley transform

  • Author

    Bi, Guoan

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
  • fYear
    1995
  • fDate
    3-7 Jul 1995
  • Firstpage
    537
  • Lastpage
    540
  • Abstract
    New results on the computational complexity of the discrete Hartley transform (DHT) are presented for the transform length N=3*2m, m>1. 1. Significant savings on the number of multiplications and additions are made compared to the previously reported algorithms which have been claimed to require the minimum number of multiplication and addition
  • Keywords
    Hartley transforms; computational complexity; DCT; additions; algorithms; computational complexity; discrete Hartley transform; multiplications; transform length; Arithmetic; Bismuth; Carbon capture and storage; Computational complexity; Computational efficiency; Content addressable storage; Costs; Discrete cosine transforms; Discrete transforms; Equations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networks, 1995. Theme: Electrotechnology 2000: Communications and Networks. [in conjunction with the] International Conference on Information Engineering., Proceedings of IEEE Singapore International
  • Print_ISBN
    0-7803-2579-6
  • Type

    conf

  • DOI
    10.1109/SICON.1995.526345
  • Filename
    526345
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3487814