The Hartley transform
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
A Wavelet Tour of Signal Processing, Third Edition: The Sparse Way
Localization of the complex spectrum: the S transform
IEEE Transactions on Signal Processing
Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartleytransform
IEEE Transactions on Signal Processing
Fractional cosine, sine, and Hartley transforms
IEEE Transactions on Signal Processing
A basis for efficient representation of the S-transform
Digital Signal Processing
Time--frequency feature representation using energy concentration: An overview of recent advances
Digital Signal Processing
Hi-index | 0.08 |
The Hartley transform, like the Fourier transform, is used for determining the spectrum of a complete time series. However, problems arise if the time series has time-dependent spectral content, since the Hartley kernel has no time localization. To this end, a short-time Hartley transform has been proposed and defined in analogy with the short-time Fourier transform. The frequency invariance of the window used in the short-time Hartley transform, though, leads to problems similar to those encountered in the short-time Fourier transform; namely, poor time resolution at high frequencies, and artifacts at low frequencies. In the Fourier case, these problems can be addressed through use of the S-transform, whose window scales with frequency to accommodate the scaling of the Fourier sinusoid. We apply the same principles to define the Hartley S-transform, using a scalable window.