Efficient computation of the running discrete Haar transform

This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on power delivery 2006-01, Vol.21 (1), p.504-505
Hauptverfasser:	Macias, J.A.R., Exposito, A.G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Artificial intelligence Complexity Computation Computational complexity Computational efficiency Computer science control theory systems Discrete Fourier transforms Discrete transforms Discrete wavelet transforms Disturbances. Regulation. Protection Electrical engineering. Electrical power engineering Electrical power engineering Exact sciences and technology Frequency domain analysis Monitoring Pattern recognition. Digital image processing. Computational geometry Power networks and lines Power quality Power system faults Power system protection Running Signal processing algorithms Transforms Wavelet transforms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents a new algorithm to compute the running discrete Haar wavelet transform of N samples which reduces the computational complexity to O(log/sub 2/(N)).
ISSN:	0885-8977 1937-4208
DOI:	10.1109/TPWRD.2005.859289