Communication System Overview and Random Process

Communication System Overview
Gwo-Ruey Lee
Wireless Access Tech. Lab.
CCU
Outlines
Communication System
Digital Communication System
Modulation
CCU
Input Transducer
Transmitter
Channel
Receiver
Output Transducer
Input Transducer Channel Transmitter Receiver Output Transducer
Input
Message
Message
Signal
Transmitted
Signal
Received
Signal
Output
Signal
Output
Message
Carrier
1/6
CCU
Input transducer
Messages can be categorized as analog (continuous
form)or digital (discrete form).
The message produced by a source must be converted by a
transducer to a form suitable for the particular type of
communication system employed.

2/6
CCU
Transmitter
The purpose of the transmitter is to couple the message
to the channel.
Modulation
For ease of radiation
to reduce noise and interference
For channel assignment
For multiplexing or transmission of several message over a
single channel
To overcome equipment limitation

3/6
CCU
Channel
Different forms
The signal undergoes degradation from transmitter to
receiver
Noise, fading, interference
4/6
CCU
Receiver
The receiver is to extract the desired message from the
received signal at the channel output and to convert it to a
form suitable for the output transducer
Demodulation
5/6
CCU
Output Transducer
The output transducer completes the communication
system
The device converts the electric signal at its input into
the form desired for the system user

6/6
CCU

Information
Source
&
Input Transducer
Source Encodre Channel Encoder
Outpot
Transducer
Source Decoder Channel Decoder
Digital
Modulator
Digital
Demodulator
Channel
Synchroniz
ation
Output
Signal
Transmitted
Signal
Received
Signal
1/6
CCU
Source Encoder/ Decoder
The purpose of source coding is to reduce the number of
bits required to convey the information provided by the
information source.
The task of source coding is to represent the source
information with the minimum of symbols.
High compression rates (Good compression rates) make be
achieved with source encoding with lossless or little loss
of information.
Source Coding
Fixed-length coding
Pulse-code modulation (PCM)
Differential Pulse-code modulation (DPCM)
Variable-length coding
Huffman Coding/ entropy coding
2/6
CCU
Channel Encoder/ Decoder
A way of encoding data in a communications channel that
adds patterns of redundancy into the transmission path in
order to lower the error rate.
The task of channel coding is to represent the source
information in a manner that minimizes the error
probability in decoding.

Error Control Coding
Error detection coding
Error correct coding
3/6
CCU
Error Control Coding
Linear block code
Convolutional code
RS code
Modulation Coding
Trellis code
Turbo code

4/6
CCU
Synchronization
Symbol/ Timing synchronization

Frequency synchronization
Carrier frequency synchronization
Sampling frequency synchronization

Two basic types of synchronization
Data-aid algorithm
Training sequences
Preambles
Non-data-aid algorithm
Blind

5/6
CCU
Channel Estimation
A channel estimate is only a mathematical estimation of
what is truly happening in nature.
Allows the receiver to approximate the effect of the
channel on the signal.
The channel estimate is essential for removing inter
symbol interference, noise rejection techniques etc.

Two basic types of channel estimation methods
Data-aid algorithm
Training sequences
pilots
Non-data-aid algorithm
Blind
6/6
CCU
Modulation
Analog Modulation
AM
FM
PM

Pulse Modulation
PAM / PPM / PCM / PWM

Digital Modulation
ASK
FSK
PSK
QAM
Amplitude
Frequency Phase
( ) ( )
cos 2
c
f c t t A t u = +
Carrier:
1/10
CCU
Modulation
Mapping
The process of mapping the information bits onto the
signal constellation plays a fundamental role in determining
the properties of the modulation

Modulation type
Phase shift keying (PSK)
Quadrature Amplitude Modulation (QAM)
2/10
CCU
Modulation
M-ary Phase Shift Keying
Consider M-ary phase-shift keying (M-PSK) for which the
signal set is

where is the signal energy per symbol, is the symbol
duration, and is the carrier frequency.

This phase of the carrier takes on one of the M possible
values, namely, , where .

( )
( )
2 1
2
cos 2 0 , 1, 2,...,
s
i c s
s
i
E
s t f t t T i M
T M
t
t
| |
= + s s =
|
\ .
s
E
s
T
c
f
( )
2 1
i
i M u t =
1, 2,..., i M =
3/10
CCU
Modulation
An example of signal-space diagram for 8-PSK
s
E
2 m
3 m
4 m
5 m
6 m
7 m
8 m
Decision
boundary
2
|
message
point
s
E
s
E
d
d
M t
M t
1 m
Decision
region
1
|
s
E
4/10
CCU
Modulation
Phase shift keying
BPSK

QPSK with Gray code

M-ary PSK

where
0
sin
s
e
E
p erfc
N M
t
| |
| |
|
|
\ .
\ .
( )
,
1
2
e BPSK
p erfc =
( )
,
1
2
e QPSK
p erfc =
( )
2
2
exp( )
x
erfc x z dz
=
}
t
: SNR
5/10
CCU
Modulation
BER versus SNR curves in AWGN channel using BPSK, QPSK,
8-PSK,16-PSK .

0 5 10 15 20 25 30
10
-6
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
SNR Vs BER
SNR
B
E
R
BPSK theoretical result
BPSK simulation
QPSK theoretical result
QPSK simulation
8PSK approximate result
8PSK simulation
16PSK approximate result
16PSK simulation
6/10
CCU
Quadrature Amplitude Modulation
The transmitted M-ary QAM signal for symbol n can be
expressed as

where E is the energy of the signal with the lowest
amplitude, and , and are amplitudes taking on
the values

Note that M is assumed to be a power of 4.
The parameter a can be related to the average signal
energy ( ) by
( ) ( ) ( )
2 2
cos 2 sin 2 , 0 , 0, 1, 2,....
n n c n c
E E
s t a f t b f t t T n
T T
t t = s s =
( )
2
, , 3 , , log 1
n n
a b a a M a = .
n
a
n
b
2
E a =
( )
3
2 1
s
E
a
M
=
s
E
Modulation
7/10
CCU
An example of signal-space diagram for 16-square
QAM.
Modulation
8/10
CCU
QAM
( )
( )
( )
( )
( )
2
,
2
1 1
1 4 | 4 2 | 2 |
log
e M QAM
p p c M p c M p c
M M

(
= I + II + III
`
(

)
( )
3
2 1
s
E
a
M
=
( )
2
2
0
2
| 1
a
p c Q
N
(
| |
I = ( |
|
(
\ .

( )
2 2
0 0
2 2
| 1 2 1
a a
p c Q Q
N N
( (
| | | |
II = ( ( | |
| |
( (
\ . \ .

( )
2
2
0
2
| 1 2
a
p c Q
N
(
| |
III = ( |
|
(
\ .

Modulation
9/10

3a a - a - 3a
a
3a
- a
- 3a
n
a
n
b
: I part
: II part
: III part
CCU
BER versus SNR curves in AWGN channel using BPSK/QPSK,
16QAM, 64QAM, 256QAM.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
10
-5
10
-4
10
-3
10
-2
10
-1
10
0
Eb/N0 Vs BER
Eb/N0
B
E
R
BPSK/QPSK theorem
BPSK/QPSK simulation
16QAM theorem
16 QAM simulation
64 QAM simulation
64 QAM theorem
256 QAM simulation
256 QAM theorem

Modulation
10/10
CCU
Communication System Overview
Readings
Any book about communications
Random Process/ Stochastic Process
CCU
Outlines
Basic Concepts
Stationary Process
Transmission over Linear Time-Invariant (LTI)
Systems
1/10
CCU
Basic Concepts
Why study random processes?
Due to the uncertainty of 1. noise and 2. the unpredictable
nature of information itself.

Information signal usually is randomlike
We can not predict the exact value of the signal
Signal must be distributed by its statistical properties.
Ex: mean, variance..

2/10
CCU
Basic Concepts
Random Variable (r.v.)
Consider an experiment with sample space . The element
of are the random outcomes, , of the experiment. If
to every , we assign a real value , such a rule
is called a random variable (r.v.)
S
S
,
,
( )
X x , =
,
S
Real line
( )
X x , =
3/10
CCU
Basic Concepts
Random Process (r.p.)
A random process is the mapping of the outcomes in
into a set of real valued functions of time, called sample
function .
( )
,
i
X t ,
1
,
S
2
,
n
,
( )
1
, X t ,
t
( )
2
, X t ,
t
( ) ,
n
X t ,
t
S
0
t t =
( )
0 1
, X t ,
( )
0 2
, X t ,
( )
0
,
n
X t ,
r.v.
1. : ensemble

2. : sample function
(or a realization)

3. : r.v.

4. : numerical value
( ) ,
i
X t ,
( )
2
, X t ,
( )
2 0
, X t ,
( )
0
,
i
X t ,
4/10
CCU
Basic Concepts
Classification of random process
From the perspective of time
Random process:
for , t has a continuous of values
Random sequence:
for , t can take on a finite or countably infinite
number of values

From the perspective of the value of
Continuous:
can take on a continuous of values
Discrete :
Values of are countable

( )
X t
( ) X t
( ) X t
( ) X n
( ) X t
( ) X t
5/10
CCU
Basic Concepts
Classification of random process

Continuous random process
Discrete random process
Continuous random sequence
Discrete random sequence
6/10
CCU
Basic Concepts
1
st
-order distributions function
It describes the instantaneous amplitude distribution of a
random process
Mean:

2
nd
-order distributions function
It distributes the structure of the signal in the time
domain
Autocorrelation Function (A.F.)

( ) ( ) { } ( )
( ) ( )
1
,
,
x X
n
i i
i
m t E X t x f x t dx
X t p , ,
=
=
=
}
( ) ( ) ( ) { }
( )
( ) ( ) ( )
1 2 1 2
1 2 1 2 1 2 1 2
1 2
1
,
, , ,
, ,
XX
X
n
i i i
i
R t t E X t X t
x x f x x t t dx dx
X t X t p , , ,

=
=
=
=
} }
7/10
CCU
Basic Concepts
Autocovariance

Cross-correlation

If and are orthogonal

If and are statistically uncorrelated

( ) ( ) ( ) ( ) ( ) { }
( ) ( ) ( )
1 2 1 1 2 2
1 2 1 2
,
,
XX X X
XX X X
C t t E X t m t X t m t
R t t m t m t
= ( (

=
( ) ( ) ( ) { } ( )
( ) ( )
( )
1 2 1 2 1 2
1 2
1
, , , ,
, , ,
XY XY
n
i i XY i i
i
R t t E X t Y t x y f x y t t dxdy
X t Y t p , , , ,

=
= =
'
' =
} }
( )
0
XY
R t = ( )
X t
( )
Y t
( )
XY X Y
R m m t =
( )
X t ( )
Y t
8/10
CCU
Basic Concepts
Crosscovariance

The autocorrelation function of a real WSS process is
( ) ( ) ( ) ( ) ( ) { }
( ) ( ) ( )
1 2 1 1 2 2
1 2 1 2
,
,
XY X Y
XY X Y
C t t E X t m t Y t m t
R t t m t m t
= ( (

=
( )
X t
( ) ( ) ( ) ( ) ( )
,
XX XX
R t t E X t X t R t t t + = + =
9/10
CCU
Basic Concepts
The cross-correlation function of two real WSS process
and is

If and are orthogonal
If and are statistically uncorrelated

Power Spectral Density (PSD)
PSD represents the distribution of signal strength (ie,
energy or power) with frequency
The PSD of WSS process is the Fourier transform (FT)
of the A.F.
( )
X t
( )
Y t
( ) ( ) ( ) ( ) ( )
,
XY XY
R t t E X t Y t R t t t + = + =
( )
0
XY
R t = ( )
X t
( )
Y t
( )
constant
XY X Y
R m m t =
=
( )
X t
( )
Y t
( ) ( ) { } ( )
( ) ( ) { } ( )
2
1 2
j f
XX XX XX
j f
XX XX XX
S f R R e d
R S f S f e df
t t
t t
t t t
t
= =
= =
}
}
( )
X t
10/10
CCU
Stationary Process
Stationary
A random process whose statistical properties do not
change over time

Stationary Process
Strictly-Sense Stationary (SSS)
Wide-Sense Stationary (WSS)
Strictly-Sense Cyclostationary
Wide-Sense Cyclostationary
1/9
CCU
Stationary Process
Strictly-Sense Stationary (SSS)
A nth-order strictly-sense stationary process is a process
in which for all , all , and all

Note: Mth-order stationary of the above equation holds
for all .
Example: 2
nd
-order SSS process 1
st
-order SSS
process

( ) ( ) ( )
( )
( ) ( ) ( )
( )
1 2
1 2
1 2
, ,...,
1 2 , ,...,
, ,...,
, ,...,
n
n
n
X t X t X t
n X t k X t k X t k
f x x x
f x x x
+ + +
=
k
( )
1 2
, ,...,
n
t t t n
n M s
2/9
CCU
Stationary Process
A example of 2
nd
-order stationary
2
t t =
1
t t =
1
,
S
2
,
n
,
( )
1
, X t ,
t
( )
2
, X t ,
t
( ) ,
n
X t ,
t
2
t t k = +
1
t t k = +
3/9
CCU
Stationary Process
Wide-Sense Stationary (WSS)
A random process is wide-sense stationary process
(WSS) if

Its mean is constant

Its A.F. depends only on the time difference.

( ) ( ) { }
constant
x
m t E X t = =
( )
X t
( ) ( ) ( )
1 2 2 1
,
xx xx xx
R t t R t t R t = =
4/9
CCU
Stationary Process
The relationship between SSS and WSS
SSS WSS (True)
SSS : WSS (Fault)

1
st
-order SSS
2
nd
-order SSS

For Gaussian process : SSS WSS
Since the joint-Gaussian pdf is completely specified by its
mean and A.F.

( ) { }
constant E X t =
( ) ( ) ( )
1 2 2 1
,
xx xx xx
R t t R t t R t = =
5/9
CCU
Stationary Process
Strictly-Sense Cyclostationary
A nth-order strictly-sense cyclostationary process is a
process in which for all , all , and integer m
( mT is integer multiples of period T )

( )
1 2
, ,...,
n
t t t
n
( ) ( ) ( )
( )
( ) ( ) ( )
( )
1 2
1 2
1 2
, ,...,
1 2 , ,...,
, ,...,
, ,...,
n
n
n
X t X t X t
n X t mT X t mT X t mT
f x x x
f x x x
+ + +
=
6/9
CCU
Stationary Process
Wide-Sense Cyclostationary
A random process with and is wide-sense
cyclostationary if

Its mean satisfies

Its a.F. satisfies

( )
X t
( ) ( )
x x
m t mT m t + =
( ) ( ) ( )
1 2 1 2
, ,
XX XX XX
R t mT t mT R t t R t + + = =
7/9
CCU
Stationary Process
Ergodic Process
A random process is strictly ergodic process if all time
and ensemble (statistical) average are interchangeable
including mean, A.F. PSD, etc.

A random process is wise-sense ergodic if it it ergodic in
the mean and the A.F.
mean ergodic

A.F. ergodic
lim
X X
T
T
m m
=
( ) ( )
lim
XX XX
T
T
R R t t
=
( ) ( )
( ) { }
2
2
1
T
T X
T
T
X
X t m X t dt
T
m E X t
}
( ) ( ) ( )
( ) ( )
( ) ( ) ( ) ( ) { }
2
2
1

XX
T T
T
T
XX
X t X t R
X t X t dt
T
R E X X t X t
t t
t
t t
+ =
= +
}
8/9
CCU
Stationary Process
The relationship between ergodic and stationary
Ergodic stationary (True)
Ergodic : stationary (Fault)

9/9
CCU
Transmission over LTI Systems
Linear Time-Invariant (LTI) Systems
LTI System
( )
h t
( )
x t ( )
y t
( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
*
*
y t x h t x t h t
h x t h t x t
t t
t t
= =
= =
}
}
( ) ( ) ( )
Y f X f H f =
1/3
CCU
Assumptions:
and are real-valued and is WSS.
The mean of the output

The cross-correlation function

( )
x t
( )
h t ( )
x t
( ) { } ( ) ( )
0
x x
E y t m h d m H t t
= =
}
( )
y t
( ) ( ) ( ) { } ( ) ( )
( ) ( ) ( ) { } ( ) ( )
YX XX
XY XX
R E Y t X t h R
R E X t Y t h R
t t t t
t t t t
= + = -
= + = -
2/3
CCU
The A.F. of the output

The PSD of the output

( ) ( ) ( ) { }
( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )

YY
YX
XY
XX
XX
R E Y t Y t
R h
R h
h R h
R h h
t t
t t
t t
t t t
t t t
= +
= -
= -
= - -
= - -
( ) ( ) ( )
2
YY XX
S f S f H f =
3/3
CCU
Random Process/ Stochastic Process
Readings
Communication Systems, 4
th
edition, Simon Haykin, Wiley
Chapter 1 1.1 ~1.7, 1.8

Communication System Overview and Random Process

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Communication System Overview and Random Process

Uploaded by

Copyright:

Available Formats

Communication System Overview

You might also like