Wavelet transforms have been one of the important signal processing developments in the last decade, especially for the applications such as time-frequency analysis, data compression, segmentation and vision. During the past decade, several efficient implementations of wavelet transforms have been derived.

Description of Wavelet transforms

The theory of wavelets has roots in quantum mechanics and the theory of functions though a unifying framework is a recent occurrence. Wavelet analysis is performed using a prototype function called a wavelet. Wavelets are functions defined over a finite interval and having an average value of zero. The basic idea of the wavelet transform is to represent any arbitrary function f (t) as a superposition of a set of such wavelets or basis functions.

These basis functions or baby wavelets are obtained from a single prototype wavelet called the mother wavelet, by dilations or contractions (scaling) and translations (shifts). Efficient implementation of the wavelet transforms has been derived based on the Fast Fourier transform and short-length 'fast-running FIR algorithms' in order to reduce the computational complexity per computed coefficient. First of all, why do we need a transform, or what is a transform anyway? Mathematical transformations are applied to signals to obtain further information from that signal that is not readily available in the raw signal.

Now, a time-domain signal is assumed as a raw signal, and a signal that has been transformed by any available transformations as a processed signal.There are a number of transformations that can be applied such as the Hilbert transform, short-time Fourier transform, Wigner transform, the Radon transform, among which the Fourier transform is probably the most popular transform.