Professional Documents
Culture Documents
DC Unit2
DC Unit2
Dr J RAVINDRANADH/PROFESSOR 1
Example
Mobile Telephone Systems GSM:
Dr J RAVINDRANADH/PROFESSOR 2
Unlike ASK signals, both PSK and FSK signals have a
constant envelope.
Dr J RAVINDRANADH/PROFESSOR 3
PSK and FSK are preferred to ASK signals for passband
data transmission over nonlinear channel (amplitude
nonlinearities) such as micorwave link and satellite channels.
Coherent and Noncoherent
Digital modulation techniques are classified into coherent
and noncoherent techniques, depending on whether the
receiver is equipped with a phase recovery circuit or not.
The phase-recovery circuit ensures that the local oscillator
in the receiver is synchronized to the incoming carrier wave
(in both frequency and phase).
Two ways in which a local oscillator can be synchronized with
an incoming carrier wave
Transmit a pilot carrier
phase-locked loop (PPL)
Dr J RAVINDRANADH/PROFESSOR 4
Binary Phase Shift Keying
PSK is a form of digital angle modulation. In this case
there are two output phases, one phase represents logic
1 and other output phase represents logic 0.
Block diagram of BPSK transmitter is shown in figure
2
1 (t ) = cos(2f c t )
Tb
Dr J RAVINDRANADH/PROFESSOR 5
To generate a binary PSK signal, the first step is
representing the input binary sequence in polar form with
symbols 1 and 0 represented by constant amplitude levels .
Signal transmission encoder is performed by a polar Non
Return to Zero encoder
7
The transmitted signal can be written as
and
Dr J RAVINDRANADH/PROFESSOR 8
Coherent PSK Detection
To detect the original binary sequence of 1s and 0s we apply
BPSK signal to a correlator. The correlator output is compared
with threshold of zero volts.
Dr J RAVINDRANADH/PROFESSOR 9
If the transmitted symbol is 1
Dr J RAVINDRANADH/PROFESSOR 11
For the first case, the observable element x1 is related to
the received signal x(t) by
12
Therefore, the conditional probability density function
of x1 , given that symbol 0 was transmitted is
Dr J RAVINDRANADH/PROFESSOR 13
and the probability of error is
Dr J RAVINDRANADH/PROFESSOR 14
Similarly the error of the second kind
Dr J RAVINDRANADH/PROFESSOR 15
Coherent Binary FSK
In a binary FSK system, symbol 1 and 0 are distinguished
form each other by transmitting one of two sinusoidal
waves that differ in frequency by a fixed amount.
Dr J RAVINDRANADH/PROFESSOR 16
The transmitted frequency nc + i
fi = Where i=1,2
Tb
Generation of Binary FSK
m(t )
Binary
2 FSK
Binary
data
On-off 1 (t ) = cos( 2f 1t ) signal
level Tb
sequence
encoder _______
Inverter
m(t )
2
2 (t ) = cos(2f 2 t )
Tb
Dr J RAVINDRANADH/PROFESSOR 17
The incoming binary data sequence is first applied to an
on-off level encoder, at the output of which symbol 1 is
represented by a constant amplitude of Eb volts and
symbol 0 is represented by zero volts.
When we have symbol 1 at the input, the oscillator with
frequency f1 in the upper channel is switched on while the
oscillator with frequency f2 in the lower channel is
switched off, with the result frequency f1 is transmitted
When we have symbol 0 at the input, the oscillator with
frequency f1 in the upper channel is switched off while
the oscillator with frequency f2 in the lower channel is
switched on, with the result frequency f2 is transmitted
Dr J RAVINDRANADH/PROFESSOR 18
Dr J RAVINDRANADH/PROFESSOR 19
Coherent detector of Binary FSK
Dr J RAVINDRANADH/PROFESSOR 20
If the transmitted symbol is 1
Tb
2E 2
x1 = ∫ cos(2f1t ) cos(2f1t )
0
Tb Tb
Tb
2
=∫ Eb cos 2 (2f 1t )
0
Tb
= Eb
= x1 - x 2
Dr J RAVINDRANADH/PROFESSOR 21
The variance of the random variable L is independent of
which binary symbol was transmitted.
N0 N0 = N0
= +
2 2
The symbol 0 was transmitted. The conditional probability
density function of the random variable L is
2
1 ( + E b )
f L (l | 0) = exp[- ]
2 N 0 2N 0
Dr J RAVINDRANADH/PROFESSOR 22
The condition x1>x2 the receiver making a decision in favor
of symbol 1, the condition probability of error given symbol
0 was transmitted
∞
Pe 0 = ∫ f L ( | 0)dl
0
1
∞
( + E b ) 2
= ∫ exp[- ]dl
2 N 0 0 2N 0
+ Eb
z=
2N 0
Changing the variable of integration from l to z
Dr J RAVINDRANADH/PROFESSOR 23
∞
1
Pe 0 = ∫ exp[- z 2 ]dz
Eb
2 N0
1 Eb
= erfc( )
2 2N 0
1 Eb
Pe = erfc( )
2 2N 0
Dr J RAVINDRANADH/PROFESSOR 24
Differential Phase Shift Keying
Differential phase Shift Keying as the noncoherent
version of PSK.
It perform the two basic operations at the transmitter
Differential encoding of the input binary wave
Dr J RAVINDRANADH/PROFESSOR 25
s1(t) denote the transmitted DPSK signal for 0 ≤t ≤ 2Tb when
we have binary symbol 1 at the transmitter input for the
second part of this interval namely Tb ≤t ≤ 2Tb, the
transmission of symbol 1 leaves the carrier phase unchanged.
Eb
s1 (t ) = cos(2f c t ) 0≤ t ≤ Tb
2Tb
Eb
cos(2f c t ) Tb ≤ t ≤ 2Tb
2Tb
Dr J RAVINDRANADH/PROFESSOR 26
Eb
s 2 (t ) = cos(2f c t ) 0≤ t ≤ Tb
2Tb
Eb
cos(2f c t + ) Tb ≤ t ≤ 2Tb
2Tb
1 Eb
Pe = erfc (- )
2 N0
Dr J RAVINDRANADH/PROFESSOR 27
Generation of DPSK
The differential encoding process at the transmitter
input stats with an arbitrary first bit serving as
reference.
Let {dk} denote the differentially encoded sequence
with this added reference
If the incoming binary symbol bk is 1, leave the symbol
dk unchanged with respect to the previous bit.
If the incoming binary symbol bk is 0 change the symbol
dk with respect to the previous bit
The differentially encoded sequence generated the
phase shift angle 0 and п represent the symbol 1 and 0.
Dr J RAVINDRANADH/PROFESSOR 28
{bk} 1 0 0 1 0 0 1 1
{dk-1} 1 1 0 1 1 0 1 1
Differential encoded 1 1 0 1 1 0 1 1 1
sequence{dk}
Transmitted phase (radians)0 0 п 0 0 п 0 0 0
2
cos(2f c t )
Tb
Dr J RAVINDRANADH/PROFESSOR 29
DPSK Receiver
Received
Signal x(t) Tb
∫ dt
0
Dr J RAVINDRANADH/PROFESSOR 30
Coherent Quadrature Modulation Techniques
Dr J RAVINDRANADH/PROFESSOR 31
Quadriphase shift keying (QPSK)
2E
cos(2i - 1) cos(2f ct )
T 4
2E
si (t ) - sin (2i 1) sin(2f ct ) 0 ≤ t ≤ T
T 4
0 elsewhere
Dr J RAVINDRANADH/PROFESSOR 33
The following observation can be made from the above
equations
There are only two orthonormal basis functions Ф1(t)
and Ф2(t) in the expansion of si(t) .These are
2
1 (t ) cos(2f c t ) 0t T
T
2
2 (t ) sin( 2f c t ) 0t T
T
There are four message points, and associated signal
vectors are defined by
E cos2i 1 4
si i 1,2,3,4
E sin 2i 1
4 34
Signal Space Characterization of QPSK
E E
00 3π/4
2 2
E E
01 5π/4
2 2
E E
7π/4
11 2 2
Dr J RAVINDRANADH/PROFESSOR 35
Signal Conctellation diagram or signal space diagram
Ф2
E Message point 4
Message point 3 (11)
(01) 2
Ф1
E E
2 2
Message point 2
Message point 1
(00)
E (10)
2
Dr J RAVINDRANADH/PROFESSOR 36
QPSK Waveform
Odd number of
Sequence
Si1ф1(t)
even number of
Sequence
Si2ф2(t)
s(t)
37
QPSK Transmitter
Block diagram of QPSK Transmitter
b1 (t )
Input 2
binary
1 (t ) = cos(2f c t ) QPSK
T wave
wave
b(t) b2 (t )
2
2 (t ) = sin( 2f c t )
T
Dr J RAVINDRANADH/PROFESSOR 38
QPSK Receiver
Output
Received
Signal x(t)
Binary
wave
39
Gram Schmidt
Orthogonalization Procedure
Transforming an incoming message mi=1,2,…M into
modulated wave si(t) may be divided into separate discrete
time and continuous time operations
Any set of M energy signals { si(t) } can be expressed as
linear combinations of N orthonormal basis functions,
where N ≤ M.
If s1(t), s2(t),….. sM(t) are real valued energy signals, each
of duration T seconds
N 0 ≤ t ≤ T
si (t ) = ∑ sij j (t ) (1)
j =1
i = 1,2,....M
40
Where the coefficients of the expansion are defined by
T
i = 1,2,....M
sij = ∫ s i (t ) j (t ) (2)
0 j = 1,2.....N
Dr J RAVINDRANADH/PROFESSOR 41
Pictorial representation for generating the signal si(t)
s i1
si 2 si (t )
siN
42
Pictorial representation for generating set of coefficients
It consists of a bank of N product-integrators or correlators
with a common input, and with each one supplied with its own
basis functions
s i1
si 2
si (t )
siN
43
Part 1
We show that any given set of energy signal {si(t)} 0 ≤ i ≤ M
over 0 ≤ t ≤ T, can be completely described a sub set of
energy signals whose elements are linearly independent.
Let us assume that all si(t) ’s are not linearly independent
Then there exists a set of coefficients a1, a2, … aM not all
equal to zero, such that,
a1 s1 (t ) + a 2 s 2 (t ) + ..... + a M s M (t ) = 0 ; 0≤ t ≤ T (4)
Lets arbitrarily aM ≠ 0 then
1
s M (t ) = - (a1 s1 (t ) + a 2 s 2 (t ) + ..... + a M -1 s M -1 (t ))
aM
1 M -1
s M (t ) = - ∑ ai si (t ) (5)
a M i=1
44
sM(t) could be expressed as linear combination of other si(t) s
i=1, 2, …. M-1
b1 s1 (t ) + b2 s 2 (t ) + ..... + bM -1 s M -1 (t ) = 0 ; 0≤ t ≤ T (6)
M -2
1
s M -1 (t ) = - ∑ bi si (t ) (7)
bM -1 i =1
Dr J RAVINDRANADH/PROFESSOR 45
Now following the above procedure for testing linear
independent of the remaining signal, eventually end up with a
linearly independent subset of the original set of signals.
the original set of signals s1(t), s2(t) … sM(t) denote this subset
Dr J RAVINDRANADH/PROFESSOR 46
Part 2
We show that it is possible to construct a set of N orthonormal
basis functions Ф1(t), Ф2(t), ……, ФN(t), from the linearly
independent signals s1(t), s2(t), ….. sN(t)
s1 (t )
1 (t ) =
E1
Where E1 is the energy of the signal s1(t)
s1 (t ) = E1 1 (t )
= s111 (t ) (8)
Dr J RAVINDRANADH/PROFESSOR 47
Determination of second basis function Ф2(t)
From equation (2) T
s 21 = ∫ s 2 (t ) 1 (t ) dt (9)
0
T T
= s 21 - s 21 = 0
∫ s 2 (t ) 1 (t ) dt - s 21 ∫ 1 (t ) 1 (t ) dt
0 0
= ∫ [s 2 (t ) - s 21 1 (t ) ]2
2
g
∫ 2 (t ) ) dt
0 0
T T T
=∫ s 2 (t ) - 2 s 21 ∫ s 2 (t ) 1 (t ) + s 21 ∫ 1 (t )
2 2 2
0 0 0
2
E2 - 2 s21 s21 s21 = E 2 - s 212 (11)
s 2 (t ) - s 211 (t )
2 (t ) = 2
(12)
E2 - s 21
and T
E 2 = ∫ s 22 (t )dt
0
T
Verified that
2
∫ 2 (t )dt = 1 Unit energy
0
g 3 (t ) = s3 (t ) - ∑ s3 j i (t )
j=1
g 3 (t ) = s3 (t ) - [ s311 (t ) + s32 2 (t ) ]
T T
g 3 (t )
3 (t ) = T
2
∫ 3 (t )dt
g
0 51
Indeed , in general
g i (t )
i (t ) T
i 1,2,...N (13)
2
∫ g (t )dt
i
0
where
i -1
g i (t ) si (t ) - ∑ siji (t ) (14)
j1
T
sij ∫ si (t ) j (t ) dt (15)
0
Dr J RAVINDRANADH/PROFESSOR 52
Example :Consider the signals s1(t), s2(t), s3(t), s4(t) shown in
figure find the basic functions
s1 (t ) s 2 (t ) s3 (t ) s 4 (t )
1 1 1 1
t t t t
0 T 0 2T T T 0 T
3 3 3
The first basis function as
1 3
s1 (t ) = = ; 0 ≤ t ≤ T/3
1 (t ) = T T
E1
3
T /3 T /3
E1 = ∫ s1 2 (t ) dt T
= ∫ 1 dt =
0 0 3
Dr J RAVINDRANADH/PROFESSOR 53
s 2 (t ) - s 211 (t )
2 (t ) = 2
E 2 - s 21
Now g 2 (t ) = s 2 (t ) - s 21 1 (t )
Dr J RAVINDRANADH/PROFESSOR 55
g 3 (t )
3 (t )
2
E3 - s32
s31 = ∫ s 3 (t ) 1 (t ) dt = 0
T
3
2T
3
s32 = ∫ s 3 (t ) 2 (t ) dt
T
3 2T
3
3 T
= ∫ 1 dt =
T T 3
56
3
2T
g 3 (t ) = 1; ≤ t≤ T
3
T 2T
=0 ≤ t≤
3 3
T T
2 = ∫ 1 dt 2T
E3 = ∫ s (t )dt
3 =
0 T 3
3
1 3
g 3 (t ) =
3 (t ) 2T T =
E3 - s 2
- T
32
3 3
s4(t) is linearly depends on s1(t) and s3(t),
Dr J RAVINDRANADH/PROFESSOR 57
In an M-ary signaling scheme
there are M possible signals during each signaling
interval of duration T. Usually, M = 2n and T = nTb where
Tb is the bit duration
In passband transmission, we have M-ary ASK, M-ary
PSK, and M-ary FSK digital modulation schemes.
We can also combine different methods:
M-ary amplitude-phase keying (APK)
M-ary quadrature-amplitude modulation (QAM)
M-ary signaling schemes are preferred over binary
signaling schemes for transmitting digital information
over band-pass channels when the requirement is to
conserve bandwidth at the expense of increased power.
Dr J RAVINDRANADH/PROFESSOR 58
The functional model of passband data transmission
system
priori probability p i = P ( mi )
Equal priority =
1
M 59
Signal transmission encoder is performed by a polar Non
Return to Zero encoder
Dr J RAVINDRANADH/PROFESSOR 60