14 November 2007 Lifting algorithm of discrete Hartley transform
Author Affiliations +
Proceedings Volume 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications; 679043 (2007) https://doi.org/10.1117/12.774770
Event: International Symposium on Multispectral Image Processing and Pattern Recognition, 2007, Wuhan, China
Abstract
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yu-hai Li, Jian Liu, Hong-bo Xu, "Lifting algorithm of discrete Hartley transform", Proc. SPIE 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications, 679043 (14 November 2007); doi: 10.1117/12.774770; https://doi.org/10.1117/12.774770
PROCEEDINGS
7 PAGES


SHARE
Back to Top