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