Lecture No.

2 (Module I) 20/12/2011
2K6EC 403 Communication Engineering-I Dr. A. Ranjith Ram
Signals
Classification: (a) 1-D, 2-D or 3-D
(b) Continuous/Discrete (Digital)
(c) Periodic/Aperiodic
(d) Deterministic/Random
(e) Energy/Power
20 DEcember 2011 7 2K6EC 403 - Communication Engineering-I
Audio
Image
Video
Why Random Signal Theory?
Almost all signals to be transmitted is random in nature since physical
systems usually produce such a category of signals.
Besides, the noise which adversely affect the overall performance of the
system is also random in nature.
Hence the analysis of random signals is inevitable in communication theory.
Th ti l (t f b d) l i f d t i i ti i l i t The conventional (transform based) analysis of deterministic signals is not
applicable to those signals which vary randomly with time.
Although it is not possible to predict the precise value of a random signal in
advance, it may be described in terms of its statistical properties.
The mathematical tool which can be used for the statistical characterization
of random signals is the Probability Theory.
Consequently the first module is entirely devoted to Probability and Random
Processes, and the next module, to the study of Noise.
20 DEcember 2011 8 2K6EC 403 - Communication Engineering-I
Module I (12 Hours)
Random process
Review of the theory of continuous random variables
Joint distribution and density functions
Conditional distribution functions
Random process Ensemble average, Stationarity, Wide sense stationarity
(WSS) Time averages Ergodicity (WSS), Time averages, Ergodicity
Correlation theory for WSS random process
Power spectral density
Wiener - Khinchie - Eienstein theorem
Response of LTI systems to random process
Guassian random process
Filtered Guassian random process
White Guassian noise
20 DEcember 2011 9 2K6EC 403 - Communication Engineering-I
Probability Theory
Random Experiment : Experiment whose outcome (result) is influenced by
chance mechanism.
e.g., tossing a fair coin
measuring the noise voltage across a capacitor
Sample point : A point s
k
, associated with the k
th
outcome of a Random
Experiment is called a sample point.
Sample space : The totality of sample points, corresponding to the aggregate of
all possible outcomes of an experiment is called the sample space, S.
Event : An event corresponds to either a single sample point or a set of sample
points. S is a sure event, the null set is an impossible event and a single sample
point is an elementary event.
Mutually exclusive events : If the occurrence of one event precludes the
occurrence of the other then they are said to be mutually exclusive.
Mutually exhaustive events : If the union of two events is the sample space S,
then they are said to be mutually exhaustive.
20 DEcember 2011 10 2K6EC 403 - Communication Engineering-I
Some Examples
Random Experiment:
1. Observing the mark obtained for a student.
2. Scoring runs by a batsman in cricket match.
3. Counting the number of vehicles in queue at a railway crossing.
4. Measuring the time taken to hit the first goal in soccer game.
5. Victory of a movie that is being released.
Mutually exclusive events:
1. Mark being a no-pass one / mark being a pass one.
2. Runs being a one-digit / runs being a century.
3. Even number of vehicles / Odd number of vehicles.
4. Time of first goal within 5 seconds / Time of first goal in extra time.
5. Movie being a super-hit / movie being a flop.
Mutually exhaustive events:
1. Yes, 2. No 3. Yes 4. No 5. No
20 DEcember 2011 11 2K6EC 403 - Communication Engineering-I