Scribd
Upload
15 views23 pages

UIT 2305 Introduction To Digital Communication

Uploaded by

vijayaselvam72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
15 views23 pages

UIT 2305 Introduction To Digital Communication

Uploaded by

vijayaselvam72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 23

UIT 2305

INTRODUCTION TO DIGITAL COMMUNICATION


UNIT 2

DIGITAL MODULATION AND DEMODULATION


Phase Shift Keying
Session objectives
 To understand the concept of PSK
 To discuss about its mathematical representation
 To study its generation and reception
Session outcomes
At the end of the session, students will be able to

 Understand the concept of PSK


 Analyze the mathematical representation of PSK
 Study PSK generation and reception
 Signal space representation of PSK
Outline
 Phase Shift Keying - Introduction
 Mathematical representation of PSK
 Signal space diagram
 PSK generation
 PSK reception
 Probability of error
Phase Shift keying

• PSK is another form of angle-modulated, constant-


amplitude digital modulation.
• The phase of the carrier is changed according to the
modulating waveform which is a digital signal.
• Carrier is 0 or 180 degree phase shifted corresponding
to two different voltage levels of binary modulating
signal.
Phase Shift keying

Source : Nptel lecture

Source : ‘Electronic Communications Systems’, Wayne Tomasi


Mathematical representation
PSK can be represented as follows,

2 Eb
S1 t   cos 2f c t 0 t Tb Symbol 1 or Binary digit 1
Tb

2 Eb
S 2 t   cos 2f c t 0 t Tb Symbol 0 or Binary digit 0
Tb

where Eb is signal energy per bit, Tb is bit duration and f c is


carrier frequency.
Here orthonormal basis signal (or simply carrier signal) is,

2
 t   cos 2f1t 0 t Tb
Tb
Mathematical representation
PSK can be represented in generalized form as
follows
For Symbol 1 or Binary digit

S1 t   E b  t  0 t Tb

For Symbol 0 or Binary digit 0

S 2 t   Eb  t  0 t Tb
Signal space diagram of PSK

Source : ‘Digital Communications’, Simon Haykin


PSK Generation
• Generation of a binary PSK signal requires
representation of the input binary sequence in polar
format with symbol 1 and 0 by  and Eb .  Eb
respectively.
• The resulting binary wave (polar format) and
sinusoidal carrier  t   T2 cos 2f t are applied to the
c
b
product modulator.
• The desired PSK signals are obtained at the
modulator output.
PSK transmitter
PSK reception or demodulation
• The noisy PSK signal is received at the receiver side.
• Detection of binary 1's and 0's from noisy PSK signal
is done by applying x(t) to the product modulator.
• The other input for the product modulator is a locally
generated carrier signal  t   T2 cos 2f t .
b
c

• The basic principle of correlator detector is


orthonormal basis operation given by
Tb

 t  t  1 when i  j and 0 for i  j


0
i j
2 Eb
1. Assuming receipt of binary 1, x(t) is f c t
cos 2(or)
Tb
and t  other input of the product modulator is
E b the
2
. When x(t)
 t  
T
and
cos 2f t
b
are integrated tthe
c 
output is . Eb

 2 E b 2 
 cos2f c t . cos 2f c t  E b 
 Tb Tb 
(since received signal carrier frequency and locally generated carrier signal
both are equal in phase). The
correlator output is
compared with a threshold where .
x1  E b
Therefore
,
receiver decides in favor of symbol
 0 1. x1   ,
2Eb
 cos 2f c t
2. Assuming receipt of binary 0, x(t) is T b
2
 t   cos 2f c t
and the other input of the product modulatorTb is
. When x(t) t  and are integrated, the  Eb .

output is   Since,


2E
  2 
 T  
b
cos 2 f tc . cos
c 2 f t
b  E 

 b T
b  

The correlator output x  E is compared with a


1 b

 , threshold where  0 . Therefore, x1   , receiver


decides in favor of symbol 0. The receiver circuit
is shown in figure
Comparison of ASK, FSK & PSK
• Probability of error is the performance tool for
comparing modulation techniques.
• Probability of error can also be represented as
 d2 
Pe Q 12 
 2N 0 
 

where, d 12 is the distance between two message points


S1 t  S 2 t . and .
• When the distance between two message points is
large, the probability of error is lower.
Analysis
• Euclidean distance with signal energy per bit of 4 V for ASK
for PSK Eb
and for FSK d 12  4 2
• It implies that PSK
d 12provides superior
2 4 2 2 4 performance compared to
other binary modulation techniques i.e., ASK and FSK.
d 12  2 4  8 2.82
• For FSK, achievement of the same probability of error of PSK
needs twice the signal energy per bit.
Probability of Error

 Eb 
• For ASK Pe Q
 N 

 0 

1  Eb 
• For PSK Pe  erfc 
2  N 
 0 

1  Eb 
• For FSK Pe  erfc  
2  2 N0 
Comparison of BPSK and BFSK
Summary
 Phase Shift Keying
 Mathematical representation of PSK
 Signal space diagram
 PSK generation and reception
 Probability of error
 To understand about Euclidean distances
 To compare various binary modulation techniques
 BPSK requires around 4 dB for achievement of a bit error rate
(BER) of , whereas BFSK requires around 7.5 dB. Hence, BPSK
requires less SNR to achieve the same BER
Test Your Understanding

 Draw the PSK waveform for the bit stream


10110001.
References

1. S. Haykin, “Digital Communications”, John Wiley,


2005.
2. Wayne Tomasi, “Electronic Communications Systems:
Fundamentals through Advanced”, 5th edition, Pearson
Prentice Hall.

You might also like