Random Process
Random Process
5 RANDOM PROCESSEs
To deternmine the probabilities of the various possible outcomes of an experiment, it is necessary to
repeat the experiment many times. Suppose that we are interested in establishing the statistics
associated with the tossing of a die. We might proceed in either of two ways. On one hand, we
might use a single die and toss it repeatedly. Alternatively, we might toss simultaneously a very
large number of dice. Intuitively, we would expect that both methods would give the same results.
Thus, we would expect that a single die would yield a particular outcome, on the average, of
Itime out of 6. Similarly, with many dice we would expect that 1/6 of the dice tossed would yield
a particular outcome.
Analogously, let us consider a random process such as a noise waveform n(t) mentioned at the
beginning of this chapter. To determine the statistics of the noise, we might make repeated mea
surements of the noise voltage output of a single noise source, or we might, at least conceptually,
make simultaneous measurements of the output of a very large collection of statistically identical
noise sources. Such acollection of sources is called an ensemble, and the individual noise wave
forms are called sample functions. A statistical average may be determined from measurements
made
2
at some fixed time t= t on all the sample functions of the ensemble. Thus to determine, say,
n*), we would, at t= t, measure the voltages n(t) of each noise source, square and add the
voltages, and divide by the (large) number of sources in the ensemble. The average so determined
is the ensemble average of n(u).
Now n(t;) is a random variable and will have associated with it a probability density function.
he ensemble averages will be identical with the statistical averages computed earlier in Secs. 2.2.6
and 2.2.7 and may be represented by the same symbols. Thus the statistical or ensemble average of
determined by measurements on a sinol.
n(4) may be written E<n*r,)] = n(1,). The averages represent as (n't).
Sample function at successive times will vield a time average, which we
same. Suppose, for exarmple, th¡
In general, ensemble averages and time averages are not the ensemble were changing with time
the statistical characteristics of the sample functions in the
COr
measurements made at
a fixed time, and the ensemble trai
Such a variation could not be reflected in the sam
When the statistical characteristics of
times
averages would be different at diferent
ran
We shall have a broader classification of random processes in Sec. 2.5.2 after we define th
autocorrelation of a random process. th
sp
2.5.2 Classification of Random Processes
random processes
We have already discussed stationarity and ergodicity in Sec. 2.5 while defining
subsection.
We look into subdivision of that and other classification in this
stationary(SSS) if its
Strict-sense stationary A random process X() is called strict sense
written as
statistics does not change with shift of origin, i.e. its n-th order density function can be
(2.142)
If x(t) is a bandpass signal and is input to the BPF of Fig. 1.27c of Chapter 1, and theit
bandwidths are same then the output will be unaltered x(t). Since, multiplication by cos(21J )
Random Variables and Processes 123
side shifts the bandpass signal by tf and J, along frequency axis and LPF1 filters out
the input components, we can write PSD for in-phase component as
the low frequency
only
Gy S) = Gyf+s)t Gr-f for |f|S Band zero elsewhere.
component,
Similarly, for quadrature
Gx)= Gy(f+s) + Grf-S) for |f|sB and zero elsewhere.
It can
be shown that, <X() X,(0)> = Ryx (0) = 0
also
x (t) = 0
and if Gyl) issymmetrical about f, Ry
called Gaussian process if X = [X(t;)
Caussian random process A random process X0) is
Y).. XU)] has a jointly multivariate Gaussian density function given
by
(2.146)
Sx(X) =
(2ryl2 |det Cq/2
Cin
: such that C; is covariance of X(t)
where, x = (xx ... x]', 4
E[X] and C=
Cml Cn
Rx;, 4,)- 4 ;
and X(t). Note that, C;=completely autocorrelations. If the input
specified by its set of means and process is WSS
A Gaussian process is output is also Gaussian. Finally, if a Gaussian
Gaussian, the
to a linear system is
then it is also SSS. = n/2, i.e.
process X() is called white noise when its PSD, Gf)
White noise A random mean is assumed to be zero.
frequency spectrum and
constant over entire
autocorrelation R(t) = &)
Fourier transform, 2
From inverse band.
has similar flat spectrum but only over the pass
The band-limited white noise
of Random Pulses
2.5.3 PSD of Seguence power spectral density of a
sequence of
information about the random
We shall occasionally need
to have pulses are of the same form but have
indicated in Fig. 2.19.
The waveform (the random
andom pulses such as is independent random times of occurrence. The invariant. Corre
alnplitudeS and statistically of the waveforms are time
features assume
that the statistical pulses. We further
Process) 1S stationary so time of separation 1, between
Spondingly, there is an invariant average
Parseval's theorem
that there is no overlap between pulses. sample pulse P.() is P,) then
of a single
the Fourier transform normalized energy of the pulse is
(E4. (1.136)]states that the (2.147)
APTER
oCESS
2.1 INTRODUCTION
asSociated with random
extensionsof the concepts
Random processes
are
parameter is brought into
the problem. In this
variables when the time issues:
discuss the following
chapter, we will
random process.
The representation of stationary.
random process to be
Required condition for a
average of a random process.
Time average and ensemble its mean.
description of a random process in terms of
The partial
correlation, and covariance
function.
ergodic.
stationary random process to be 2.2.1 Cla
Required condition for a
for a random process to be
at least WSS
Minimum required condition
(wide sense stationary).
of
description of a random process in terms
The frequency-domain
power spectral density.
Random process in a linear system.
RANDOM PROCESS
2.2
functions
process) is an indexed set of real
A random process (or stochastic 2.2.2 P:
Figure 2.1 shows the sample
of time that has certain statistical properties.
outcome of a sample
functions of a random process X(t, s) where s is the
simply use X(t)to
space S. To simplify the notation, we suppress s and
denote the random process.
Sample
space
S
X(t,s)
X(1,s,)
2.2.3
t+
X(t,s,)
Process
2.2.2 Probability Density Function of Random
process {X(t, s)} is given by the N-fold
A complete description of a random
describes the possible values assumed by
a
joint pdf that probabilistically
t - 1 . > t, where N is arbitrary.
typical sample function at time tN >
joint pdf as
For N=1, we can interpret this
at time t)
fs (2i, t) da, = P( - da < XËs pdf aS
where X = X(t, s). Similarly, for N=2, we can interpret the joint
< XË` Ë and - da, < X¡ s )
fxx,(1, t: 2, ta)da, da, = P(a - da, denote the N-dimensional PDF of a
general, we
where X,= X(t,s). In
random procesS as
fa(z) = fay({4), z(ta), ...tw)
2.2.3 Stationary Random Process
the order N if, for any
random process X(t) is said to be stationary to
A
ti, ta...., tN
fxo(z(t+ to), z(t t to),..a(ty t to))
fo((4), z(ta),..(tN)real= constant. Furthermore, the process is said to
where to is any arbitrary to the order N ’ 0,
strictly stationary if it is stationary
be
2.3 AVERAGES OF RANDOM PROCESS
We may define the time average
and ensenble average of a random
in the following ways: nroos
NOTE :
are usually statistically
Physically independent random processes
uncorrelated processes are
independent and, hence, uncorrelated. However,
not necessarily independent.
Autocovariance Function
2.3.5
The autocovariance function of a stationary process is defined as
= E|X()]
X= (X(t )) ergodic = X(t)
process can be defined as
2. The dc power of an
2.6
2.5 WIDE SENSE STATIONARY PROCESS
POINT TO REMEMBER
A process that is stationary to order 2 or greater is wide-sense stationary.
However, the converse is not necessarily true.
Sx(0) =Rx(r) ar
2.6.3
Cross Spectral Density
stationary processes
with their o
two jointly
X(t) and Y(t) be We then define
Let denoted Rxy(7) and Ryx(T).
by
correlation functions
ess
processes as
cross-spectral densities for the random
-2nf d
Sxr()= Rxr(r)e
Syx(f)= Ryx(r)e nt dr
and
Fourier transformation. w°e
formula for inverse
Accordingly, using the
also write
Rxy(r) = |Sxr()eh af
and Ryx(T) = Sxf)enh df
2.8
DENSITY
PROPERTY OF CROSS SPECTRAL
Syx(f) are not necessarily the real
The cross-spectral densities Sxyf)and
property of autocorrelation function.
function of f. However, using the
we may deduce that
Sxr(f) = Srx(-f) = Six (f)
SIGNAL
METHODOLOGY: TO EVALUATE AC POWER OF A RANDOM
Special Case :
When X(t) and Y(t)are uncorrelated and ux uy = 0, then the cross-spectral
density vanishes, i.e.
Rxy (7) = Ryx(t) =0
Under this condition, the above relation becomes
Rz(r) = Rx(r)+ Ry()
Sz(f) = Sx(f)+ Sy()
Also,
1.1 INTRODUCTION
The need for probability theory arises in every scientifie discipline, since it
Is impOssible to be eXactly sure of values that are obtained by measurernent.
Ihis chapter is intended to be a short course in probability and random
variables. Thc topics included in this chapter are as follows:
Probability theory that establishes a mathematical framework for the
study of randomn phenonenon.
Random variable that defines a rule or relationship for an event.
Cumulative distributionfunction (CDF) and probability density funetion
(PDF for continuous random variable.
Statistical averages (mean, variance, standard deviation, moments) that
play an important role in the characterization of random variables.
Some inportant probability distributions: Binomial distribution.
Gaussian distribution, Poisson distribution, and Rayleigh distribution.
1.2 PROBABILITY
Probability theory establishes a mathematical framework for the study of
random phenomenon. We may define the probability of an event in following
two ways:
DEFINITION I
The probability of an event A, denoted by P(A), nay bà defined as
n(A)
PA) =
where
n(S)
n(S) = Total number of sample space S (possible outcomes)
nA) = Number of favourable event A
In the case of the die, we have the sample space
S ={1,2,3. 4. 5,6}
Assume that the event A is defined s
A =(2.3}
ie.. the event Aconsists of two mutually exchusive outcomes. So, we get the
probability of event A aS
n4)
P(A) =
DEFINITION II
The probability of an event A, denoted by P(A), may be defined in ternas of
the relative frequency of A oceurring in n trials.
P(A) - lim)
where n, is the number of times that A occurs inn trials.
MUTUALLY EXCLUSIVE
The events A and B are said to be mutually exclusive if
P(AB) = 0
P(B| A) = P(AB)
P(A)
P(AB)
PA| B) = P(B)
This is known as Bayes' theoren.
for S I
Ths we have mnpped the tao outeomes into the two pointa on the real
hne S this is Calledn diecrete random variahir
Probability Density Fanction of Discrete Random Variable
Tet a diseTete radom variable N having the poesible ottcotnes
So the probability density funtion (PDE) of the disc rete random variable
is defied as
1L2.
h(z) - P(N- )
Cumulative Distribution Function of Discrete Random Variable
For the randon variable Wr define the Cumulative distribution function
(CDE) As
Fx(z) = P(XS )-f)+f )+...+fr)
Fr(-o) =0
E() = 1
2
3 Pa<zs b) = Fr(b)- Ex(a)
2 JA)dr =1
3 PXS) = ()-[ajdA,
1. Pa<rs b)-[)dr
ke) =A()
Step 4: Substitute the results of step-2 and step-3 in equation (1.1) to,
get pdf of random variable z, i.e.
) =k()a)
1.5 MULTIPLE RANDOM VARIABLES
Multiple random variables are basically multidimensional function defined
on a sample space of a combined experiment.
Cumulative Distribution Function of Joint Random Variable
Let the two randon variables X and Y,each of which may be contiuous,
discrete. or mixed. The joint CDF for the two randon variables is defined as
Fxy (z, y) = P(X s 1,Y S y)
Some important properties of CDF of joint random variable are given below.
Ran
PROPERTIES OF CDF OF JOINT RANDOM VARIABLE
1.
2.
Fry(-o,- co) = Fxr(3, - ) = Fxr(-0,u) =0
3.
Fxy(o0, oo) =1
Fx (z) = Fxy(,0)
4
F(v) = Fxy (0,y)
Probability Density Function of Joint Random Variable
The PDF of joint random variables X andY can be defined as
fxr(z.y) Fxr(r. y)
drôy
Some important properties of PDF of joint random variable are given below.
E(X)=X- h(2)dr
Similarly, we obtain the expected value of a function g(X) as
1.6.2 Moments
In general, the nth moment of the random variable X is defined as
Layout 4 Save
Ox =/Var[X] = /X
1.6.5 Characteristic Function
The characteristic function ox(v) of the probability
distribution of a random
variable X is defined as the expectation of the complex
r . i.e. exponential function
ox(") =E|e=[e"s(2)dr
Also, we may deduce the inverse relation as
1
k() =| ox(v)e dv
Hence, the characteristic function and
random variable constitute the Fourier probability density function of a
transform pair.
1.6.6 Joint Moments
For a pair of rarndom variables X and
Y, we define the joint moment as
E|X' Y*] =
where i and k nay assume any rk(r.y)dr dy
positive integer values.
1.6.7 Covariance
The covariance of the random
variables X and Y is defined as
cov[XY] = Oxy = E(X- px)(Y- ))
=(X- ux)X(Y- y)
POINTS TO REMEMBER
1. The random variables X and Y are uncorrelated if and only if their
covariance is zero, i.e
cov[XY] = 0
2. The random variables X and Y are orthogonal if and only if their
correlation is zero, i.e.
E[XY] = 0
POINTS TO REMEMBER
1. The random variables X and Y are uncorrelated if and only if their
covariance is zero, i.e
cov[XY] =0
2. The random variables X and Y are orthogonal if and only if their
correlation is zero, i.e.
E[XY] = 0
Step 2: Obtain the second moment (mean square value ) of given random
variable by using the expressions given below.
when X is continuous RV
Many problems has been devised and studied as models for various random
phenomena. In this section, we will discuss the properties of two discrete
continuous
and Rayleigh)
discrete
randor
Binomial Distribution
an
integer-valued
experiment witl
1.7.1 distribution
describes
a chance
Binomial Consider probabilitio
The repeated trials. the
variable
associated with outcomes A and A with
exhaustive
exchusive,
mutually
two
respectively as
P(A) = P
P(A) =q=1-p numerically equal to
and variable K to be
the discrete random chance experiment.
If we assign
event A occurs in n trials of our probability of
the number of
times Distribution. The
Binomial
distribution is called
the resulting
exactly k heads in n trials is given by
P(K= ) ="Cup q given by
random variable K
The mean of the binomial
MK = EK]= np
randon variable is given by
and the variance of the Binomial
aK = npg
notations and write
For simplicity, we omit the subscript K from the
u = np
and G' = npq
PA) =e k!
This is called the Poisson distribution. The mean and variance of
Poisson
random variable is given by
u=oT
and o = =a1
The Poison model also approximates the
very large, p is very small, and the product npqBinomial model when n is
distribution is given by np. The approximated
42)
2
is
The corresponding CDF of Ravleigh random variable
SR(T) = 1-eo'