• DocumentCode
    1475585
  • Title

    Fast DHT algorithms for length N=q*2m

  • Author

    Bi, Guoan ; Chen, Yan Qiu

  • Author_Institution
    Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
  • Volume
    47
  • Issue
    3
  • fYear
    1999
  • fDate
    3/1/1999 12:00:00 AM
  • Firstpage
    900
  • Lastpage
    903
  • Abstract
    This article presents an improved split-radix algorithm that can flexibly compute the discrete Hartley transforms (DHT) of length-q*2m where q is an odd integer. Comparisons with previously reported algorithms show that savings on the number of arithmetic operations can be made. Furthermore, a wider range of choices on different DHT lengths is naturally provided
  • Keywords
    digital arithmetic; discrete Hartley transforms; signal processing; arithmetic operations; computational complexity; digital signal processing; discrete Hartley transforms; fast DHT algorithms; split-radix algorithm; transform length; Arithmetic; Bismuth; Computational complexity; Computational efficiency; Content addressable storage; Differential equations; Digital signal processing; Discrete transforms; Signal processing algorithms;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.747800
  • Filename
    747800
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1475585