Title :
Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
Author_Institution :
Dept. of Comput. Sci., CICESE, Ensenada
fDate :
6/1/2007 12:00:00 AM
Abstract :
Fast algorithms for computing generalized discrete Hartley transforms in a sliding window are proposed. The algorithms are based on second-order recursive relations between subsequent local transform spectra. New efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete Hartley transforms and running recursive algorithms
Keywords :
Hartley transforms; computational complexity; signal processing; second-order recursive relations; signal processing; sliding discrete Hartley transforms; sliding window; subsequential local transform spectra; Computational complexity; Discrete Fourier transforms; Discrete transforms; Equations; Filtering; Filters; Signal processing; Signal processing algorithms; Spectral analysis; Speech analysis; Discrete Hartley transform (DHT); running algorithm; sliding algorithm;
Journal_Title :
Signal Processing, IEEE Transactions on
DOI :
10.1109/TSP.2007.893960
