Digital Signal Processing/Haar Transform

From Wikibooks, open books for an open world
Jump to navigation Jump to search

Haar Wavelet[edit | edit source]

Haar Matrix[edit | edit source]

Haar Transform[edit | edit source]

The Haar Transform, or the Haar Wavelet Transform (HWT) is one of a group of related transforms known as the Discrete Wavelet Transforms (DWT). DWT Transforms, and the Haar transform in particular can frequently be made very fast using matrix calculations. The fastest known algorithm for computing the HWT is known as the Fast Haar Transform, and is comparable in speed and properties to the Fast Fourier Transform.

Uses of the Haar Transform[edit | edit source]

Haar transform uses non-sinusoidal basic wavefunction. So it has great applications related to DSP. The basic haar transform matrix is defined by the function Hk(x). Where o<=k<=N-1, N is the matrix size.

Computing Haar Transform[edit | edit source]

Further reading[edit | edit source]