Cross-covariance

From HandWiki

In probability and statistics, given two stochastic processes {Xt} and {Yt}, the cross-covariance is a function that gives the covariance of one process with the other at pairs of time points. With the usual notation E for the expectation operator, if the processes have the mean functions μX(t)=E[Xt] and μY(t)=E[Yt], then the cross-covariance is given by

KXY(t1,t2)=cov(Xt1,Yt2)=E[(Xt1μX(t1))(Yt2μY(t2))]=E[Xt1Yt2]μX(t1)μY(t2).

Cross-covariance is related to the more commonly used cross-correlation of the processes in question.

In the case of two random vectors 𝐗=(X1,X2,,Xp)T and 𝐘=(Y1,Y2,,Yq)T, the cross-covariance would be a p×q matrix KXY (often denoted cov(X,Y)) with entries KXY(j,k)=cov(Xj,Yk). Thus the term cross-covariance is used in order to distinguish this concept from the covariance of a random vector 𝐗, which is understood to be the matrix of covariances between the scalar components of 𝐗 itself.

In signal processing, the cross-covariance is often called cross-correlation and is a measure of similarity of two signals, commonly used to find features in an unknown signal by comparing it to a known one. It is a function of the relative time between the signals, is sometimes called the sliding dot product, and has applications in pattern recognition and cryptanalysis.

Cross-covariance of random vectors

Main page: Cross-covariance matrix

Cross-covariance of stochastic processes

The definition of cross-covariance of random vectors may be generalized to stochastic processes as follows:

Definition

Let {X(t)} and {Y(t)} denote stochastic processes. Then the cross-covariance function of the processes KXY is defined by:[1]:p.172

KXY(t1,t2)=def cov(Xt1,Yt2)=E[(X(t1)μX(t1))(Y(t2)μY(t2))]

 

 

 

 

(Eq.1)

where μX(t)=E[X(t)] and μY(t)=E[Y(t)].

If the processes are complex-valued stochastic processes, the second factor needs to be complex conjugated:

KXY(t1,t2)=def cov(Xt1,Yt2)=E[(X(t1)μX(t1))(Y(t2)μY(t2))]

Definition for jointly WSS processes

If {Xt} and {Yt} are a jointly wide-sense stationary, then the following are true:

μX(t1)=μX(t2)μX for all t1,t2,
μY(t1)=μY(t2)μY for all t1,t2

and

KXY(t1,t2)=KXY(t2t1,0) for all t1,t2

By setting τ=t2t1 (the time lag, or the amount of time by which the signal has been shifted), we may define

KXY(τ)=KXY(t2t1)KXY(t1,t2).

The cross-covariance function of two jointly WSS processes is therefore given by:

KXY(τ)=cov(Xt,Ytτ)=E[(XtμX)(YtτμY)]=E[XtYtτ]μXμY

 

 

 

 

(Eq.2)

which is equivalent to

KXY(τ)=cov(Xt+τ,Yt)=E[(Xt+τμX)(YtμY)]=E[Xt+τYt]μXμY.

Uncorrelatedness

Two stochastic processes {Xt} and {Yt} are called uncorrelated if their covariance K𝐗𝐘(t1,t2) is zero for all times.[1]:p.142 Formally:

{Xt},{Yt} uncorrelatedK𝐗𝐘(t1,t2)=0t1,t2.

Cross-covariance of deterministic signals

The cross-covariance is also relevant in signal processing where the cross-covariance between two wide-sense stationary random processes can be estimated by averaging the product of samples measured from one process and samples measured from the other (and its time shifts). The samples included in the average can be an arbitrary subset of all the samples in the signal (e.g., samples within a finite time window or a sub-sampling of one of the signals). For a large number of samples, the average converges to the true covariance.

Cross-covariance may also refer to a "deterministic" cross-covariance between two signals. This consists of summing over all time indices. For example, for discrete-time signals f[k] and g[k] the cross-covariance is defined as

(fg)[n] =def kf[k]g[n+k]=kf[kn]g[k]

where the line indicates that the complex conjugate is taken when the signals are complex-valued.

For continuous functions f(x) and g(x) the (deterministic) cross-covariance is defined as

(fg)(x) =def f(t)g(x+t)dt=f(tx)g(t)dt.

Properties

The (deterministic) cross-covariance of two continuous signals is related to the convolution by

(fg)(t)=(f(τ)*g(τ))(t)

and the (deterministic) cross-covariance of two discrete-time signals is related to the discrete convolution by

(fg)[n]=(f[k]*g[k])[n].

See also

References

  1. 1.0 1.1 Kun Il Park, Fundamentals of Probability and Stochastic Processes with Applications to Communications, Springer, 2018, 978-3-319-68074-3