Jump to content

Complex random vector

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fvultier (talk | contribs) at 16:40, 24 December 2017 (New draft for article about complex random variables.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In probability theory and statistics, complex random vectors are a generalization of real random vectors to complex numbers, i.e. the possible values a complex random vectors may take are complex vectors. Complex random variables can always be considered as pairs of real random vectors: their real and imaginary parts.

Some concepts of real random vectors have a straightforward generalization to complex random vectors. E.g. the definition of the mean of a complex random vector. Other concepts are unique to complex random vectors.

Applications of complex random vectors are found in digital signal processing.

Definition

A complex random vector on the probability space is a function such that the vector is a real real random vector on .[1]: p.292 

Expectation

As in the real case the expectation of a complex random vector is taken component-wise.[1]: p.293 

Covariance matrix and pseudo-covariance matrix

The covariance matrix contains the covariances between all pairs of components. The covariance matrix of an random vector is an matrix whose th element is the covariance between the i th and the j th random variables. It is a hermitan matrix.[1]: p.293 

The pseudo-covariance matrix (also called relation matrix) is defined as follows. In contrast to the covariance matrix defined above transposition gets replaced by hermitan transposition in the definition.

Cross-covariance matrix and pseudo-cross-covariance matrix

The cross-covariance matrix between two complex random vectors is defined as: [2]

And the pseudo-cross-covariance matrix is defined as:

Circular symmetry

A complex random vectors is called circularly symmetric if for any deterministic the distribution of equals the distribution of .[2]: p.500–501 

The expectation of a circularly symmetric complex random vectors is either zero or it is not defined.

Proper complex random vectors

Definition

A complex random vector is called proper if the following three conditions are all satisfied:

  • (finite variance)

Properties

  • A complex random vector is proper if, and only if, for all (deterministic) vectors the complex random variable is proper.[1]: p.293 
  • Linear transformations of proper complex random vectors are proper, i.e. if is a proper random vectors with components and is a deterministic matrix, then the complex random vector is also proper.
  • Every circularly symmetric complex random vector with finite variance of all its components is proper.[1]: p.295 

Characteristic function

The characteristic function of a complex random vector with components is a function defined by:[1]: p.295 

See also

References

  1. ^ a b c d e f Lapidoth, Amos, A Foundation in Digital Communication, Cambridge University Press, 2009.
  2. ^ a b Tse, David, Fundamentals of Wireless Communication, Cambridge University Press, 2005.