A new class of reciprocal-orthogonal parametric transforms
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
IEEE Transactions on Signal Processing
| Hi-index | 35.69 |
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