Share Email Print
cover

Proceedings Paper

Lifting algorithm of discrete Hartley transform
Author(s): Yu-hai Li; Jian Liu; Hong-bo Xu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 14 November 2007
PDF: 7 pages
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
Show Author Affiliations
Yu-hai Li, Huazhong Univ. of Science and Technology (China)
Central China Normal Univ. (China)
Jian Liu, Huazhong Univ. of Science and Technology (China)
Hong-bo Xu, Central China Normal Univ. (China)


Published in SPIE Proceedings Vol. 6790:
MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications

© SPIE. Terms of Use
Back to Top