Fast Jacket-Haar Transform with Any Size

Guibo Liu, Dazu Huang, Dayong Luo, Wang Lei, Ying Guo and Moonho Lee

Mathematical Problems in Engineering, 2015, vol. 2015, 1-11

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/628642.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/628642.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:628642

DOI: 10.1155/2015/628642

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().