Misplaced Pages

Autocorrelation matrix: Difference between revisions

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 19:34, 29 August 2010 editPavon (talk | contribs)80 editsNo edit summary← Previous edit Revision as of 22:08, 31 August 2010 edit undoBearcat (talk | contribs)Autopatrolled, Administrators1,570,943 edits categorization/tagging using AWBNext edit →
Line 1: Line 1:
The autocorrelation matrix is used in various digital signal processing algorithms. It consists of elements of the discrete ] function, <math>R_{xx}(j)</math> arranged in the following manner: The '''autocorrelation matrix''' is used in various digital signal processing algorithms. It consists of elements of the discrete ] function, <math>R_{xx}(j)</math> arranged in the following manner:


:<math>\mathbf{R_x} = \begin{bmatrix} :<math>\mathbf{R_x} = \begin{bmatrix}
Line 13: Line 13:
== References == == References ==
* Hayes, Monson H., ''Statistical Digital Signal Processing and Modeling'', John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8. * Hayes, Monson H., ''Statistical Digital Signal Processing and Modeling'', John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8.

{{Uncategorized|date=August 2010}}

Revision as of 22:08, 31 August 2010

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

R x = [ R x x ( 0 ) R x x ( 1 ) R x x ( 2 ) ⋯ R x x ( N − 1 ) R x x ( 1 ) R x x ( 0 ) R x x ( 1 ) ⋯ R x x ( N − 2 ) R x x ( 2 ) R x x ( 1 ) R x x ( 0 ) ⋯ R x x ( N − 3 ) ⋮ ⋮ ⋮ ⋱ ⋮ R x x ( N − 1 ) R x x ( N − 2 ) R x x ( N − 3 ) ⋯ R x x ( 0 ) ] {\displaystyle \mathbf {R_{x}} ={\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 Toeplitz matrix. More specifically because R x x ( j ) = R x x ( − j ) = R x x ( N − j ) {\displaystyle R_{xx}(j)=R_{xx}(\!-j)=R_{xx}(N-j)} , it is a circulant matrix.

References

  • Hayes, Monson H., Statistical Digital Signal Processing and Modeling, John Wiley & Sons, Inc., 1996. ISBN 0-471-59431-8.
This redirect has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar redirects. (August 2010)
Category:
Autocorrelation matrix: Difference between revisions Add topic