0% found this document useful (0 votes)
14 views34 pages

Lecture 6 Digital Modulation 2024

Uploaded by

lhduong2506
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views34 pages

Lecture 6 Digital Modulation 2024

Uploaded by

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

Viet Nam National University Ho Chi Minh City

University of Science

Faculty of Electronics & Telecommunications

Chapter 6:
Basic Digital Modulations

Dang Le Khoa
Email: [email protected]
Outline
– ASK, OOK, MASK
– FSK, MFSK
– BPSK, DBPSK, MPSK
– MQAM,
– OQPSK
– Bit error rate.
ASK, OOK, MASK
⚫ The amplitude (or height) of the sine wave varies to transmit the
ones and zeros

⚫ One amplitude encodes a 0 while another amplitude encodes a 1


(a form of amplitude modulation)
On-off keying

2 Ei
si (t ) = cos (ct +  )
T
On-off keying (M=2):
si (t ) = ai 1 (t ) i = 1, ,M “0” “1”
s2 s1
2  1 (t )
 1 (t ) = cos (ct +  ) 0 E1
T
ai = Ei

4
Ideal Nyquist pulse (filter)
Ideal Nyquist filter Ideal Nyquist pulse

H( f )
h(t ) = sinc(t / T )
T 1

0 − 2T − T 0 T 2T
−1 1 f t
2T 2T
1
W=
2T
5
Nyquist pulses (filters): no ISI at the sampling time
6
The raised cosine filter
⚫ Raised-Cosine Filter
– A Nyquist pulse (No ISI at the sampling time)

1 for | f | 2W0 − W

 2   | f | +W − 2W0 
H ( f ) = cos   for 2W0 − W | f | W
 4 W − W0 
0 for | f | W

cos[2 (W − W0 )t ]
h(t ) = 2W0 (sinc(2W0t ))
1 − [4(W − W0 )t ]2
W − W0
Excess bandwidth:W − W0 Roll-off factor r = W0
0  r 1
7
The Raised cosine filter – cont’d

| H ( f ) |=| H RC ( f ) | h(t ) = hRC (t )


1 r =0 1

r = 0.5
0.5 0.5 r =1
r =1 r = 0.5
r =0

−1 − 3 −1 0 1 3 1 − 3T − 2T − T 0 T 2T 3T
T 4T 2T 2T 4T T

Rs
Baseband W sSB = (1 + r ) .
2
Passband W DSB = (1 + r ) Rs .

8
Binary amplitude shift keying, Bandwidth
⚫ d ≥ 0 → related to the condition of the line

BDSB = (1+r) Rbaud = (1+r) Rb


Implementation of binary ASK
OOK and MASK
⚫ OOK (On-OFF Key)
– 0 silence.
– Sensor networks: battery life, simple implementation
⚫ MASK: multiple amplitude levels
Pro, Con and Applications
⚫ Pro
– Simple implementation
⚫ Con
– Major disadvantage is that telephone lines are very susceptible to
variations in transmission quality that can affect amplitude
– Susceptible to sudden gain changes
– Inefficient modulation technique for data
⚫ Applications
– On voice-grade lines, used up to 1200 bps
– Used to transmit digital data over optical fiber
– Morse code
– Laser transmitters
Example
⚫ We have an available bandwidth of 100 kHz which spans from 200 to
300 kHz. What are the carrier frequency and the bit rate if we
modulated our data by using ASK with r = 1?
⚫ Solution
⚫ The middle of the bandwidth is located at 250 kHz. This means that
our carrier frequency can be at fc = 250 kHz. We can use the formula
for bandwidth to find the bit rate (with n= 1 and r = 1).

B = (1+r) Rbaud = 2 xRb=100KHz


=> Rb=50kbps
Frequency Shift Keying
⚫ One frequency encodes a 0 while another frequency encodes a 1
(a form of frequency modulation)

⚫ Represent each logical value with another frequency (like FM)

 A cos(2f1t )
 binary 1
s (t ) = 


A cos(2f 2 t ) binary 0
FSK Bandwidth
⚫ Limiting factor: Physical capabilities of the carrier
⚫ Not susceptible to noise as much as ASK

⚫ Applications
– On voice-grade lines, used up to 1200bps
– Used for high-frequency (3 to 30 MHz) radio transmission
– used at higher frequencies on LANs that use coaxial cable
Example
⚫ We have an available bandwidth of 100 kHz which spans from
200 to 300 kHz. What should be the carrier frequency and the
bit rate if we modulated our data by using FSK with r= 1?
⚫ Solution
– This problem is similar to Example 5.3, but we are modulating
by using FSK. The midpoint of the band is at 250 kHz. We
choose 2Δf to be 50 kHz; this means

B = (1+r) Rbaud+ 2Δf = 100KHz


=>2xRb= 2xRbaud =50kHz
=> Rb=25kbps

EE 541/451 Fall 2007


Multiple Frequency-Shift Keying (MFSK)
⚫ More than two frequencies are used
⚫ More bandwidth efficient but more susceptible to error
si (t ) = A cos 2f i t 1 i  M
f i = f c + (2i – 1 – M)f d
f c = the carrier frequency
f d = the difference frequency
M = number of different signal elements = 2 n
n = number of bits per signal element
FSK detection
Phase Shift Keying
⚫ One phase change encodes a 0 while another phase change
encodes a 1 (a form of phase modulation)

 A cos(2f c t )
 binary 1
s (t ) = 
 A cos(2f ct +  )
 binary 0
DBPSK, QPSK
⚫ Differential BPSK
– 0 = same phase as last signal element
– 1 = 180º shift from last signal element

⚫ Four Level: QPSK  


A cos 2f c t + 
  4
11
3 



A cos 2f c t + 
s (t ) = 
01
 4 
 3 
A cos 2f c t − 

00
 4 

 
A cos 2f c t −
 
 10
 4
QPSK Example
Bandwidth
⚫ Min. BW requirement: same as ASK!
⚫ Self clocking (most cases)

BDSB = (1+r) Rbaud


Example
⚫ We have an available bandwidth of 100 kHz which spans from
200 to 300 kHz. What are the carrier frequency and the bit
rate if we modulated our data by using QPSK with r = 1?
⚫ Solution
– The middle of the bandwidth is located at 250 kHz. This
means that our carrier frequency can be at fc = 250 kHz.
We can use the formula for bandwidth to find the bit rate
(with n= 2 and r = 1).

B = (1+r) Rbaud = 2 xRbaud=100KHz


Rbaud=50ksps => Rb=100kbps
Concept of a constellation diagram
MPSK
⚫ Using multiple phase angles with each angle having more than
one amplitude, multiple signals elements can be achieved
R R
Rbaud = =
n log 2 M
– Rbaud = modulation rate, baud
– R = data rate, bps
– M = number of different signal elements = 2n
– n = number of bits per signal element
QAM – Quadrature Amplitude Modulation
⚫ Modulation technique used in the cable/video networking world
⚫ Instead of a single signal change representing only 1 bps –
multiple bits can be represented buy a single signal change
⚫ Combination of phase shifting and amplitude shifting (8 phases, 2
amplitudes)
QAM
⚫ QAM
– As an example of QAM, 12
different phases are combined
with two different amplitudes
– Since only 4 phase angles have 2
different amplitudes, there are a
total of 16 combinations
– With 16 signal combinations, each
baud equals 4 bits of information
(2 ^ 4 = 16)
– Combine ASK and PSK such that
each signal corresponds to
multiple bits
– More phases than amplitudes
– Minimum bandwidth requirement
same as ASK or PSK
QAM
⚫ QAM is a combination of ASK and PSK
– Two different signals sent simultaneously on the same carrier frequency
s(t ) = d1 (t )cos 2f ct + d 2 (t )sin 2f ct
– M=4, 16, 32, 64, 128, 256
Bit Error Probability
Noise na(t)
i T

d(i) gTx(t) gRx(t) r0 (i T ) + n(iT )

We assume: • binary transmission with d (i ) {d0 ,d1}


• transmission system fulfills 1st Nyquist criterion
• noise n (i T ), independent of data source
p N (n )

Probability density function (pdf) of n (i T )


Mean and variance

n
Conditional pdfs
The transmission system induces two conditional pdfs depending on d (i )

• if d (i ) = d0 • if d (i ) = d1

p 0 (x ) p1 ( x)

x
d0 d1 x
Gaussian Distribution (review)
⚫ Gaussian distribution also called Normal distribution is one of
the most common and important distributions
⚫ PDF
fx ( x ) =
1
e
−( x − m )
2
( )
2 2
m is the mean and is  variance
2 
⚫ CDF
 m−a  1  m−a 
F (a) = Q   = erfc   Complementary Error Function
   2  2 
p1 ( x )

d1 x
Probability of wrong decisions
Placing a threshold S
p 0 (x ) p1 ( x)
Probability of
wrong decision

x x
S S d1
 d0 S
Q0=  p 0 ( x) dx Q1=
− p 1 ( x)dx
S

When we define P0 and P1 as equal a-priori probabilities of d0and d1


we will get the bit error probability (P0 = P1 = 1
2)

Pb = P0Q0 + PQ
1 1
Bit error rate with error function complement

d +d 1  m−a  1  d −d 
Pb = erfc    Pb = erfc  1 0 
S =a= 0 1 2  2  2  2 2 N 
2

antipodal:(BPSK) Expressions with E S and N 0 Unipolar:(OOK)


d
a = 0, m = d d1= +d ; d0 = −d d1 = + d ; d0 = 0 a = , m=d
2
1  d −d  1  d  1  d  1  d2 
Pb = erfc  1 0  = erfc   Pb = erfc   = erfc  

 2 2 N  2 N  2 2 N  8 N
2
2  2  2  2 
1  d2  1  SNR  1  d2 / 2  1  SNR 
= erfc   = erfc   = erfc   = erfc  
2  2 N2  2 2  4 N2  2
    2    4 
d2 ES d2 / 2 ES
SNR = 2 = SNR = =
 N matched N 0 / 2  N2 matched N / 2
0

1  ES  1  ES 
Pb = erfc   Q function Pb = erfc  
2  N0  2  2 N0 
 
Bit error rate for unipolar and antipodal transmission

⚫ BER vs. SNR

theoretical
-1
10 simulation
unipolar

-2
10
BER

antipodal
-3
10

-4
10
-2 0 2 4 6 8 10
ES
in dB
N0

You might also like