Title :
New formulation of fast discrete Hartley transform with the minimum number of multiplications
Author :
Chan, Yuk-Hee ; Siu, Wan-chi
Author_Institution :
Dept. of Electr. Eng., Hong Kong Polytech., Kowloon, Hong Kong
Abstract :
A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2m . This algorithm achieves the same multiplicative complexity as Malvar´s algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar´s algorithm
Keywords :
computational complexity; computerised signal processing; transforms; 1D DHT; fast discrete Hartley transform; minimum multiplications; multiplicative complexity; one-dimensional discrete Hartley transform; reduced additions; sequence lengths; signal processing; Computational complexity; Content addressable storage; Costs; Digital arithmetic; Discrete Fourier transforms; Discrete transforms; Equations; Fast Fourier transforms; Fourier transforms;
Conference_Titel :
Communications, Computers and Signal Processing, 1991., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-87942-638-1
DOI :
10.1109/PACRIM.1991.160744
