Fast Jacket-Haar Transform with Any Size

Abstract

Jacket-Haar transform has been recently generalized from Haar transform and Jacket transform, but, unfortunately, it is not available in a case where the length is not a power of 2. In this paper, we have proposed an arbitrary-length Jacket-Haar transform which can be conveniently constructed from the 2-point generalized Haar transforms with the fast algorithm, and thus it can be constructed with any sizes. Moreover, it can be further extended with elegant structures, which result in the fast algorithms for decomposing. We show that this approach can be practically applied for the electrocardiogram (ECG) signal processing. Simulation results show that it is more efficient than the conventional fast Fourier transform (FFT) in signal processing.