# wavedec

Multilevel 1-D discrete wavelet transform

## Description

## Examples

## Input Arguments

## Output Arguments

## Algorithms

Given a signal *s* of length *N*, the DWT consists
of at most log_{2}
*N* steps. Starting from *s*, the first step produces
two sets of coefficients: approximation coefficients
*cA _{1}* and detail coefficients

*cD*. Convolving

_{1}*s*with the lowpass filter

`LoD`

and the highpass filter
`HiD`

, followed by dyadic decimation (downsampling by 2), results
in the approximation and detail coefficients respectively. where

— Convolve with filter

*X*$$\begin{array}{||}\hline \downarrow 2\\ \hline\end{array}$$ — Downsample (keep the even-indexed elements)

The length of each filter is equal to 2*n*. If *N* =
length(*s*), the signals *F* and
*G* are of length *N* + 2*n* −1
and the coefficients *cA _{1}* and

*cD*are of length

_{1}floor$$\left(\frac{N-1}{2}\right)+n$$.

The next step splits the approximation coefficients
*cA _{1}* in two parts using the same
scheme, replacing

*s*by

*cA*, and producing

_{1}*cA*and

_{2}*cD*, and so on.

_{2}The wavelet decomposition of the signal *s* analyzed at level
*j* has the following structure:
[*cA _{j}*,

*cD*, ...,

_{j}*cD*].

_{1}This structure contains, for *j* = 3, the terminal nodes of the
following tree:

## References

[1] Daubechies, I. *Ten Lectures on Wavelets*, CBMS-NSF Regional
Conference Series in Applied Mathematics. Philadelphia, PA: SIAM Ed, 1992.

[2] Mallat, S. G. “A Theory for Multiresolution Signal Decomposition: The
Wavelet Representation,” *IEEE Transactions on Pattern Analysis and
Machine Intelligence*. Vol. 11, Issue 7, July 1989, pp.
674–693.

[3] Meyer, Y. *Wavelets and Operators*. Translated by D. H.
Salinger. Cambridge, UK: Cambridge University Press, 1995.

## Extended Capabilities

## Version History

**Introduced before R2006a**