Misplaced Pages

Revision as of 10:35, 11 February 2014

The autocorrelation matrix is used in various digital signal processing algorithms. It consists of elements of the discrete autocorrelation function, ${\displaystyle R_{xx}(j)}$ arranged in the following manner:

${\displaystyle \mathbf {R} _{x}=E={\begin{bmatrix}R_{xx}(0)&R_{xx}^{*}(1)&R_{xx}^{*}(2)&\cdots &R_{xx}^{*}(N-1)\\R_{xx}(1)&R_{xx}(0)&R_{xx}^{*}(1)&\cdots &R_{xx}^{*}(N-2)\\R_{xx}(2)&R_{xx}(1)&R_{xx}(0)&\cdots &R_{xx}^{*}(N-3)\\\vdots &\vdots &\vdots &\ddots &\vdots \\R_{xx}(N-1)&R_{xx}(N-2)&R_{xx}(N-3)&\cdots &R_{xx}(0)\\\end{bmatrix}}}$

This is clearly a Hermitian matrix and a Toeplitz matrix. If ${\displaystyle \mathbf {x} }$ is wide-sense stationary then its autocorrelation matrix will be nonnegative definite.

The autocovariance matrix is related to the autocorrelation matrix as follows:

Failed to parse (syntax error): {\displaystyle \mathbf{C}_x &= E\\ &= \mathbf{R}_x - \mathbf{m}_x\mathbf{m}_x^H\\ }

Where ${\displaystyle \mathbf {m} _{x}}$ is a vector giving the mean of signal ${\displaystyle \mathbf {x} }$ at each index of time.

References

• Hayes, Monson H., Statistical Digital Signal Processing and Modeling, John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8.

• Matrices
• Signal processing