期刊:
Journal of Computers (Taiwan),2018年29(3):188-196 ISSN:1991-1599
通讯作者:
Li, Yu-Hai(yhli@mail.ccnu.edu.cn)
作者机构:
[Li, Yu-Hai; Hu, Yan-Hong] Department of Information Management, Central China Normal University, Wuhan, China;[Xie, Wen-Qi] School of Computer Science, Yangtze University, Jingzhou, China;[Hu, Yan-Hong] College of Vocational and Continuing Education, Central China Normal University, Wuhan, China
通讯机构:
Department of Information Management, Central China Normal University, Wuhan, China
摘要:
The discrete Hartley transform(DHT) is a real-valued transform that directly maps a real-valued sequence to a real-valued spectrum. Compared with the discrete Fourier transform(DFT), DHT requires less memory space and the computation complexity. To further speed the implementation of DHT, the lifting scheme is introduced the fast Hartley transform algorithm. The lifting scheme is employed which was originally developed to build second generation wavelet. It approximates the float-point operation by integer multiplications and additions with less loss. In this paper, the DHT and its fast algorithm are briefly reviewed, and the lifting scheme is introduced and the multiplierless FHT is constructed. Experiment results verify the efficiency of the proposed algorithm.