Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
Vitaly Kober · IEEE Transactions on Signal Processing · 2007
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