Bab 3

Bandpass Modulation
and Demodulation
Modulasi Bandpass
• Modulator bandpass mengubah deretan bit menjadi
sinyal yang memiliki frekuensi yang berpusat pada
wc
• Modulator menghasilkan
• Modulator menyimpan bit informasi didalam
Amplitudo (A), atau frekuensi (w) atau fasa ( )
• Memerlukan gelombang carrier yang proses
selanjutnya memiliki bentuk dasar yang sama
dengan dengan modulasi analog yang informasinya
dalam bentuk digital yang dikenal sebagai modulasi
digital contohnya ASK, FSK, PSK, dan QAM.
 Basic Types of Modulation

1. Continuous Wave (CW) Carrier Modulation

• Gelombang pembawa (carrier waveform) berupa gelombang kontinyu (biasanya
sinusoidal)
• Salah satu parameter dari gelombang pembawa diubah sesuai bentuk sinyal
informasi yang akan ditransmisikan
2. Pulse Modulation
• Gelombang pembawa (carrier waveform) berbentuk pulsa (biasanya pulsa
persegi/rectangular)
• Salah satu parameter dari pulsa gelombang pembawa diubah sesuai bentuk
sinyal informasi yang akan ditransmisikan
 Amplitudo, Frekuensi, Phase
cycle (T)

voltage
+900
A B
C
B
A
1800 00 π 2π
0 time (t)
C
Amplitude (V)
-90
0

Amplitudo
Nilai maksimum dari besaran elektrik (mis voltage) dari gelombang

Frekuensi
Jumlah cycle yang dihasilkan dalam satu detik (cycles per second atau Hertz)

Phase
Gelombang A dengan phase 00
Gelombang B dengan selisih phase -90 0 (lebih lambat) terhadap A
Gelombang C dengan selisih phase +90 0 (lebih cepat) terhadap A
 Pulse Amplitude Modulation (PAM)
• Konsep dasar PAM adalah mengubah amplitudo pembawa yang berupa deretan pulsa
(diskrit) mengikuti bentuk amplitudo dari signal informasi yang akan dikirimkan
• Sinyal informasi yang dikirim tidak seluruhnya tapi hanya sampelnya saja (sampling
signal)

voltage
voltage

time
Modulation
voltage time

Message signal
Modulated
signal
time
Carrier
 Modulasi Digital

 Teknik modulasi digital pada prinsipnya merupakan variant

dari metode modulasi analog
 Teknik modulasi digital :
• Teknik dasar :
 Amplitude shift keying (ASK)
 Frequency shift keying (FSK)
 Phase shift keying (PSK)
• Variant dari teknik dasar di atas :
 4 Pulse Amplitude Modulation (4-PAM)
 Quadrature Phase Shift Keying (QPSK)
 Quadrature Amplitude Modulation (QAM)
 BASK, BFSK dan BPSK
Binary Amplitude Shift Keying (BASK)
Sinyal direpresentasikan dalam dua kondisi perubahan amplitudo gelombang pembawa
•Sinyal “1”  direpresentasikan dengan status “ON” (ada gelombang pembawa)
•Sinyal “0”  direpresentasikan dengan status “OFF” (tidak ada gelombang
pembawa)

Binary Frequency Shift Keying (BFSK)

Sinyal direpresentasikan dalam perubahan frekuensi gelombang pembawa
•Sinyal “1”  direpresentasikan dengan frekuensi tinggi
•Sinyal “0”  direpresentasikan dengan frekuensi rendah

Binary Phase Shift Keying (BPSK)

Sinyal direpresentasikan dalam perubahan phase gelombang pembawa
•Sinyal “1”  Phase gelombang pembawa tidak bergeser (pergeseran phase 0 0)
•Sinyal “0”  Phase gelombang pembawa bergeser 1800 (berlawanan)
 BASK, BFSK dan BPSK

Signal

BASK

BFSK

BPSK
SM241013 - Pengantar Sistem Telekomunikasi
Semester genap 2006-2007
4 Pulse Amplitude Modulation (4-PAM)

Sinyal direpresentasikan dengan 4 nilai besaran amplitudo dari gelombang

pembawa.

Bit value Amplitude

00 -2
-2 -1 +1 +2 01 -1
00 01 10 11 10 +1
11 +2
 Quadrature Phase Shift Keying (QPSK)

Sinyal direpresentasikan dengan 4 status pergeseran phase dari gelombang

pembawa.
01
+900

Bit value Phase shift

00 00
11 00 01 +900
180
0
00 10 -900
11 1800

-900
10
Quadrature Amplitude Modulation (QAM)
 Merupakan kombinasi amplitude modulation dan phase shift keying
 Sinyal direpresentasikan dalam kombinasi besaran amplitudo (2 besaran) dan
pergeseran phase (4 status).
 Memungkinkan kecepatan yang lebih tinggi untuk bandwidth yang ditentukan
 Lebih tahan terhadap noise

011
900

Bit value Amplitude Phase shift

010
2 000 1 00
1 001 2 00
101 100 000 001 010 1 900
1800 00
011 2 900
100 1 1800
110 101 2 1800
110 1 2700
111 2 2700
2700
111
Quadrature Amplitude Modulation (QAM)
Contoh :
Bit stream sinyal sbb : 001010100011101000011110
Bagi dalam kelompok masing-masing 3 bit: 001-010-100-011-101-000-011-
110

Perubahan amplitudo dan Bentuk gelombang modulasi

phase
Bit value Amplitude Phase shift

001 2 00
010 1 900
100 1 1800
011 2 900
101 2 1800
000 1 00
011 2 900
110 1 2700
Sinyal Cosinus
A

Y=A cos(21t)

T
Cont’A

Y=A cos(22t)

T
ASK (Amplituda Shift Keying)
Amplituda Shift Keying
Mengubah bit input menjadi sinyal
dimana bit disimpan dalam
amplituda
BASK (Binary Amplitude Shift Keying)
4-ASK
8-ASK
PSK
Phase Shift Keying
Mengubah deretan input bit menjadi
dimana bit direpresentasikan
dalam bentuk fasa
B-PSK (Binary-PSK)
Seluruh varian PSK
FSK
Frequency Shift
Keying
Bit 1 =
Bit 0=
Varian FSK
 Memilih metode modulasi
 Jika kanal memiliki banyak distorsi
amplitudo jangan gunakan metode
ASK, jika kanal memiliki banyak
distorsi frekuensi jangan gunakan
FSK, jika kanal memiliki banyak
distorsi fasa jangan gunakan PSK
 Jika sudah diputuskan metode
modulasinya, jenis modulasinya
seperti apa? Misalkan digunakan
PSK, apakah BPSK, 4PSK atau 8
PSK?
 Semakin besar teknik modulasi
maka semakin kecil
bandwidth,seperti gambar di
sebelah
4.1 Why Modulate?
Why Modulate ?
 4.1 Why Modulate?

 Digital modulation :
digital symbol : waveform compatible with the characteristic
of the channel
 Why use carrier?
ⓐ reduce size of antenna (=3108m/fc)
e.g.) fc = 3kHz : antenna span : /4 = 25km
fc = 900 MHz : antenna diameter : /4 = 9cm
ⓑ frequency-division multiplexing
ⓒ minimize the effect of interference : spread spectrum
ⓓ place a signal in a frequency band where design
requirements are met (e.g.)RF->IF
4.1 Why Modulate?
4.2 Digital Bandpass Modulation Technique
General form of a carrier wave
s (t )  A(t ) cos  (t )
 (t )  0t   (t )
 s (t )  A(t ) cos[0t   (t )]
4.2.1 Phasor Representation of a Sinusoid
complex notation of a sinusoidal carrier wave
e j0t  cos 0 t  j sin 0 t
 4.2 Digital Bandpass Modulation Technique

 Analytical form of transmitted waveform (cos  m t ,  m  0 ) ( AM )

 j 0 t  e j m t e  j m t 
s (t )  Ree 1   
  2 2 
 Analytical representation of narrowband FM(NFM)
    
s(t)  Re  e j0t 1  e  jmt  e jmt 
  2 2 
4.2 Digital Bandpass Modulation
Technique
4.2.2 Phase Shift Keying
2E 0  t  T 
si (t )  cos0t  i (t )  
T i  1,..., M 
2i
i (t )  i  1,..., M
M
4.2.3 Frequency Shift Keying
2E 0  t  T 
si (t )  cos(i t   )  
T i  1,..., M 
4.2.4 Amplitude Shift Keying
2 Ei (t ) 0  t  T 
si (t )  cos(0t   )  
T i  1,..., M 
4.2 Digital Bandpass Modulation Technique
 4.3 Detection of signals in Gaussian Noise

4.3.1 Decision Regions

Two-dimensional signal space (M=2)
 Detector decides which of the signals s 1 or s2 was transmitted,
after receiving r
=>Minimum-error decision rule chooses the signal class s.t.
distance d  is
r minimized
si
 Decision region
 Decision rule
r  Region1  s1 sent
r  Region2  s2 sent
 4.3 Detection of signals in Gaussian Noise
4.3.2 Correlation Receiver

 Received signal r (t )  si (t )  n(t ) 0  t  T , i  1,..., M

 Detection process
Step 1 : Transform the waveform r(t) into a single random variable(R.V.)

Z (T ) or R.V .' Z i (T ) (i  1,..., M )

Matched filter (Correlator) maximizes SNR
T
Z i (T )   r (t ) s (t )dt
0
i

Step 2 : Choose waveform si(t) that has the largest correlation with r(t)
Choose the si(t) whose index corresponds to the max Zi(T)
 Another detection approach (Fig.4.7.(b)) Any signal set can be
expressed in terms of some set of basis functions

si (t ) (i  1,..., M )  j (t ) ( j  1,..., N ) where N  M

 4.3 Detection of signals in Gaussian Noise

Signal N symbol M

Signal N< symbol M

Ex) M-ary PSK
N=2
 4.3 Detection of signals in Gaussian Noise
4.3.2.1 Binary Detection Threshold

 Decision stage : choose the signal best matched to the

coefficients aij (with the set of output Zj(T))
4.3 Detection of signals in Gaussian Noise

1
p( z )   p( z | s1 )  p( z | s2 ) 
2
4.3 Detection of signals in Gaussian Noise
 Minimum error criterion for equally likely binary signals
corrupted by Gaussian noise

 For antipodal signals,

or decide s1 (t ) if z1 (T )  z2 (T )
s2 (t ) otherwise
 4.4 Coherent Detection
4.4.1Coherent Detection of PSK(BPSK)
 Coherent detector
 BPSK example
2E
s1 (t )  cos(0t   ) 0  t  T
T
2E
s2 (t )  cos(0t     )
T
2E
 cos(0t   ) 0  t  T
T
( E : signal energy per symbol )
 Orthonormal basis function
2
 1 (t )  cos(0t ) 0  t  T
T
si (t )  ai1 1 (t )
 s1 (t )  a11 1 (t )  E 1 (t )
s2 (t )  a21 1 (t )   E 1 (t )
4.4 Coherent Detection

4.4.1Coherent Detection of PSK(BPSK)

 When s1(t) is transmitted, the expected values of product integrator

T 
E z1 | s1  E   E 12 (t )  n(t ) 1 (t )dt 
0 
T  2
E z2 | s1  E    E 12 (t )  n(t ) 1 (t )dt  then,  1 (t )  cos 0t
0  T
T 2 
E z1 | s1  E   E cos 2 0t  n(t ) cos 0t )dt  E 
0 T 
T 2 
E z2 | s1  E    E cos 2 0t  n(t ) cos 0t )dt   E 
0 T 

 Decision stage
Choose the signal with largest value of zi(T)
4.4.2 Sampled Matched Filter
 Example 4.1 Sampled Matched Filter Consider the BPSK waveform set

s1 (t )  cos t and s2 (t )   cos t

Illustrate how a sampled matched filter or correlator can be used to detect a received
signal, say s1(t), from the BPSK Waveform set, in the absence of noise.

(e.g .   2 1000, Ts  0.25m sec, T  1m sec)

Sampled MF (N samples per

symbol)
 4.4 Coherent Detection

Ex) Sampled MF (4 samples per

symbol)

sampled s1

z1 (k  3)  2

s1 (T  t )
sampled s2

3
z 2 [k  3]   s1[3  n]c2 [n] z2 (k  3)  2
n 0
 4.4 Coherent Detection
4.4.3 Coherent Detection of Multiple Phase Shift Keying

 Signal space for QPSK(quadri-phase shift keying), M=4 (N=2)

 For typical coherent MPSK system,  Orthonormal basis function

2E 2i 2 2
si (t )  cos(0t  ) 0  t  T , i  1,..., M  1 (t )  cos 0t ,  2 (t )  sin 0t
T M T T
 4.4.3 Coherent Detection of Multiple PSK

 Signal can be written as  Received signal

si (t )  ai1 1 (t )  ai 2 2 (t )

 E cos(
2i 2i
) 1 (t )  E sin( ) 2 (t )
r (t )  si (t )  n(t )
M M
(0  t  T , i  1,..., M )
 Demodulator T
 2 (t ) upper correlator : X   r (t ) 1 (t )dt
0
M 8 i 1
T
lower correlator : Y   r (t ) 2 (t )dt
i 8 0
 1 (t )
ˆ  arctan(Y X ) decision i
i5 i7
Demodulator of multiple-PSK
T
upper correlator : X   r (t ) 1 (t )dt
0
T
lower correlator : Y   r (t ) 2 (t )dt
0

ˆ  arctan(Y X )
4.4.4 Coherent Detection of FSK
 Typical set of FSK signal waveforms

2E
si (t )  cos(i t   ) 0  t  T where i  1,..., M
T
 Orthonormal set

E
 j (t )  cos  j t ( j  1,..., N )
T  Distance between any two prototype signal
T
2E 2 vectors is constant
 aij (t )   cos i t cos  j tdt
0
T T d ( si , s j )  si  s j  2 E for i  j
 aij (t )  E for i  j
0 otherwise
 The ith prptotype signal vector is located on the ith coordinated axis a displacement from
origin E
 4.4 Coherent Detection

 Example:3-ary FSK signal

i  2i M
 4.5 Non-coherent Detection
4.5.1 Detection of Differential PSK
 Non-coherent detection : actual value of the phase
of the incoming signal is not required
2E
Tx signal : si (t )  cos[0t   i (t )]
T
2E
Rx signal : r (t )  cos[0t   i (t )   ]  n(t ) (0  t  T , i  1,..., M )
T
• For coherent detection, MF is used
• For non-coherent detection, this is not possible because MF
output is a function of unknown angle α
4.5.1 Detection of Differential PSK
 Differential encoding : information is carried by
the difference in phase between two successive
waveforms. To sent the i-th message (i=0,…,M),
the present signal must have its phase advanced by
i  2i over the previous signal
M
 Differential coherent detection : non-coherent because
it does not require a reference in phase with received
carrier Assuming that αvaries slowly relative to 2T,
phase difference is independent of α as

[ k (T2 )   ]  [ j (T1 )   ]   k (T2 )   j (T1 )  i (T2 )

4.5.1 Detection of Differential PSK

 DPSK Vs. PSK

 DPSK : 3dB worse than PSK
 PSK compares signal with clean reference
 DPSK compares two noisy signals,
reducing complexity
4.5.2 Binary Differential PSK Example

c(k )  c(k  1)  m(k ) or

c(k )  c(k  1)  m(k ) (used here )

Sample index k

Original message

Differential encoder
message
Correspondng
phase

1 Arbitrary setting
decoder
4.5 .3 Non-coherent Detection of Binary Differential FSK

• Just an energy detector without phase measurement

• Twice as many channel branches
• Quadrature receiver
4.5 .3 Non-coherent Detection of Binary Differential FSK

 Three different cases :

1) r (t )  cos 1t  n(t )

2) r (t )  sin 1t  n(t )
3) r (t )  cos(1t   )  n(t )

 Another implementation for

non-coherent FSK detection
 Envelop detector :
rectifier and LPF
Looks simpler, but (analog)
filter require more complexity
 4.5.4 Required Tone Spacing for Non-coherent
Orthogonal FSK Signaling
 In order for the signal set to be orthogonal, any
pair of adjacent tones must have a frequency
separation of a multiple of 1/T[Hz] cf) Nyquist filter
si (t )  (cos 2 f i t )rect ( t ) Minimum tone separation:1/T[Hz]
T
 1 for  T  t  T
 2 2
where rect ( t )  
T
0 for t  T 2
Fourier transform
F {si (t )}  Tsinc( f  f i )T
 4.5 Non-coherent Detection : Example 4.3

⊙ Non-coherent FSK signal : cos(2 f1t   ) cos 2 f 2t where f1  f 2

T 1
0
cos(2 f1t   ) cos 2 f 2tdt  0 for orthogonality  f1  f 2 
T
e.g . two tones f1  10, 000 Hz and f 2  11, 000 Hz orthogonal ?
if rate  1, 000 symvols / s, then orthogonal
if rate  1, 000 symvols / s, then not orthogonal
1
⊙ Coherent FSK signal :  0  f1  f 2 
2T
T
0
cos(2 f1t   ) cos 2 f 2tdt
T T
 cos   cos 2 f1t cos 2 f 2tdt  sin   sin 2 f1t cos 2 f 2tdt
0 0

sin 2 ( f1  f 2 )T cos 2 ( f1  f 2 )T  1 sin 2 ( f1  f 2 )T cos 2 ( f1  f 2 )T

 cos   sin   0
2 ( f1  f 2 ) 2 ( f1  f 2 ) 2 ( f1  f 2 ) 2 ( f1  f 2 )
since f1  f 2  0
Non-
coherent
 4.7 Error Performance for Binary Systems
4.7.1Probability of Bit Error for Coherently Detected BPSK

 Antipodal signals
2E
s1 (t )  cos(0t   )
T
2E s1 (t )  a11 1 (t )  E 1 (t )
s2 (t )  cos(0t     ) 
T s2 (t )  a21 1 (t )   E 1 (t )
2E
 cos(0t   ) 0  t  T
T
 Basis function  Decision rule is

 1 (t ) 
2
cos 0t for 0  t  T
s1 (t ) if z (T )   0  0
T 
s2 (t ) otherwise
 4.7 Error Performnace for Binary Systems
1
PB  P ( H 2 | s1 ) P ( s1 )  P ( H1 | s2 ) P ( s2 )  P ( s1 )  P ( s2 ) 
2
1 1
PB  P ( H 2 | s1 )  P ( H1 | s2 )
2 2 The same a
PB  P ( H 2 | s1 )  P ( H1 | s2 )  symmetry of pdf priori

probability
PB   P( z | s2 )dz
( a1  a2 )
0
2

u 
1  1  z  a2  
2

  exp    dz
( a  a )  0 2
u 1 2
 2   0   a1 a2
2

 1

 u2  z  a2 

  Q( X )  
2 x
exp  du, u 
 2

 0 

4.7 Error Performance for Binary Systems

u 
1  u2   a1 a2 
PB  
( a1  a2 ) 2
exp  du  Q
 2  2 0 

u
2

a1  Eb , a2   Eb , Eb : signal energy per binary symbol

N0
Since  02 
2
N0 N0
(n(t ) : white noise with PSD  Rn ( )   ( ))
2 2

1  u2   2 Eb 
PB   2
exp  du  Q
 2


2 Eb N 0  N0 
4.7 Error Performance for Binary Systems
 Another approach (1)
4.7 Error Performance for Binary Systems
 Another approach (2)

2
BPSK Ed  4 Eb BFSK
s2 s1 s2
Ed  ( 2 Eb ) 2
Eb s1
Eb Eb
Eb 1
 4.7 Error Performance for Binary Systems
 Probability of bit error for several types of binary systems
TABLE 4.1 Probability of Error for Selected
Binary Modulation Schemes

Modulation PB

 2 Eb 
PSK(coherent) Q 

 N0 

DPSK 1  E 
(dfferentially coherent) exp  b 
2  N0 
Orthogonal FSK  Eb 
(coherent)
Q 

 N 0 

1  E 
Orthogonal FSK exp  b 
(noncoherent) 2  2N0 
 4.8 M-ary Signaling and Performance
4.8.2 M-ary Signaling(M=2k k:bits, M=# of waveforms)
M-ary ①
M-ary PSK
orthogonal k↑ BER↑
k↑ BER↑ BW↑ same BW
Shannon
Limit
-1.6dB
k=∞
②

(R, Eb/No, BER, BW) : fundamental “trade-off”

4.8.3 Vectorial View of MPSK Signaling

① (M=2k↑, the same Eb/No)

 bandwidth efficiency (R/W) ↑, PB ↑
② (M=2k↑, the same PB)
 bandwidth efficiency (R/W) ↑, Eb/No
↑
4.8.4 BPSK and QPSK : the same bit error probability

 General relationship  QPSK = two orthogonal BPSK

BPSK QPSK channel (I stream, Q stream)
Eb S / 2  2W  S W 
     Magnitude I stream Q stream (
N0 N  R  NR (A) ( A/root(2) ) A/root(2) )
Power/bit Half Half
Bit rate Half Half
 S  REb N  WN 0
4.8 M-ary Signaling and Performance

Eb S 2  W  S  1 
 If original QPSK is given by R[bps], S[watt], each BPSK :     
N 0 N 0  R 2  N 0  R 
Same BER, BW efficiency : BPSK=1,QPSK=2[bit/s/Hz]
 Eb/N0 vs. SNR
 Eb N 0 ( Normalized SNR ):the most meaningful way of comparing one digital system with another
Eb S  W  Eb S  WT  S  WT  Eb S  1 
          
N0 N  R  N 0 N  log 2 M  N  k  N0 N  k 
log 2 M k
where W : Detection BW , R   : data rate, WT  1(typical )
T T
 Effect of normalized SNR : noise increases as k increases
 4.8 M-ary Signaling and Performance

 Fig. 4.34 : M-ary orthogonal signaling at P E=10-3 in

dB(decibel, nonlinear), factor(linear)

k=10 (1024-ary symbol), 20SNR(factor)→2SNR per bit(factor);

each bit require 2.

Eb S
 [dB ]  [dB ]  10 log k
N0 N
 Eb S 
 N [dB ]  N
[dB ] : k  1( BPSK ) 
 0 
 Eb S 
 N [dB ]  N
[dB ]  3[dB ] : k  2(QPSK )
 0 
 
 Eb [dB ]  S
[dB ]  4.77[dB ] : k  3(8 PSK ) 
 N0 N 
 
 Eb [dB ]  S
[dB ]  10[dB ] : k  10 
 N 0 N 
 4.9 Symbol Error Performance for M-ary System(M>2)

4.9.4 Bit Error Probability vs. Symbol Error Probability for Multiple Phase Signaling

 Assume that the symbol(011) is transmitted

If an error occur, (010) or (100) is likely→3bit errors
 Gray code : neighboring symbols differ from one another in only one bit position
PE P
PB   E ( for PE  1), PE  symbol erroer probability
log 2 M k
 BPSK vs. QPSK Note that PE  1  (1  PB ) k .
PE  PB for BPSK
PE  2 PB for QPSK