3. Transformations of random processes
A transformation of a random process is defined by the same function applied to any realization of the process, with the result Y(s Y , ω) = f[X(s X , ω)], where s X and s Y are the supports of X and Y respectively. The result of the transformation is itself a random process. In general, the function f can itself be random, for example in so-called "stochastic" algorithms. But in the context of this article, the function itself will be deterministic, which entails that the realization Y(s Y , ω) is entirely determined by the realization X(s X , ω). The function f may itself depend on the support, e.g. if s ...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Signal processing and its applications
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Transformations of random processes
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference