Fast computation of the discrete Hartley transform

摘要

The discrete Hartley transform (DHT) is a real-valued transform closely related to the discrete Fourier transform (DFT) of a real-valued spectrum which preserves some useful properties of DFT. In this paper, an algorithm is proposed to realize one-dimensional DHT with sequence length N = 2~((2×m)), m≥2. The proposed algorithm requires fewer multiplications than some of the algorithms in the literature.