A Pyramid Algorithm For The Haar Discrete Wavelet Packet Transform

Simple item page
dc.creatorLuhanga, Edith T.
dc.creatorLuhanga, Matthew L.
dc.date2016-02-19T06:25:07Z
dc.date2016-02-19T06:25:07Z
dc.date2013-10
dc.date.accessioned2018-03-27T08:52:22Z
dc.date.available2018-03-27T08:52:22Z
dc.descriptionOne area of application of the discrete wavelet transform (DWT) has been the detection and classification of physiological signals such as electroencephalography (EEG) signals. Anomalies in EEGs yield very low frequency signals which are ideal for analysis using the DWT. Anomalies in mechanical systems yield high frequency signals. The structure of the DWT makes it an un-ideal tool for the analysis of such signals. Such signals are, however, ideal for analysis using the wavelet packet transform (WPT) in which Mallat’s pyramid algorithm is applied to the multiresolution analysis (MRA) of both the approximation and detail subspaces of a signal. As a contribution to the computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet transform (DWPT) from two-scale relations for wavelet packets. The algorithm is used in the derivation of the fast Haar discrete wavelet packet transform (FHDWPT) and its inverse. It is found out that the FHDWPT is computationally as efficient as the fast Fourier transform (FFT).
dc.identifierEdith T. Luhanga and Matthew L. Luhanga, “A Pyramid Algorithm for the Haar Disrete Wavelet Packet Transform”. Submitted to The Global Journal of Engineering Research in October, 2013.
dc.identifierhttp://hdl.handle.net/123456789/447
dc.identifier.urihttp://hdl.handle.net/123456789/3468
dc.languageen
dc.publisherBachudo Science Co. Ltd
dc.subjectWavelet
dc.subjectPackets
dc.subjectHaar
dc.subjectPyramid
dc.subjectAlgorithm
dc.titleA Pyramid Algorithm For The Haar Discrete Wavelet Packet Transform
dc.typeConference Paper

Files

Collections

Department of Electronics and Telecommunications Engineering