Professional Documents
Culture Documents
Digital Modulation Schemes Proakis Slides
Digital Modulation Schemes Proakis Slides
Contents
3.3 Signaling
g
g Schemes with Memory
y
3.1 Digitally
g
y Modulated Signals
g
3.1 Digitally
g
y Modulated Signals
g
Memoryless Modulation
3.1 Digitally
g
y Modulated Signals
g
Mapping from the set of current k bits and the past (L1)k bits to the
set of M=2k possible signals
The modulation scheme can be viewed as a mapping from the
current state and the current input of the modulator to the set of
output signals resulting in a new state of the modulator.
This defines a finite-state machine with 2(L1)k states :
at t = l1,, the modulation is in state S l 1 1,, 2,, , 2 ( L 1 ) k
at t =l, the input sequence is I l {1, 2, , 2k } , then the modulation
moves to the next state Sl = f s ( Sl 1 , I l )
L is the constraint length of modulation.
Can be effectively represented by a Markov Chain.
3.1 Digitally
g
y Modulated Signals
g
otherwise, it is nonlinear.
Signal interval : Ts
Signaling rate or Symbol rate : Rs = 1/ Ts
Bit interval : Tb = Ts / k = Ts / log 2 M
Bit rate : R = 1/ Tb = k / Ts = kRs = Rs log 2 M
3.1 Digitally
g
y Modulated Signals
g
Eavg = pm Em
m =1
Eavg
Eavg
k
llog 2 M
Ebavg
The average power is Pavg =
= REbavg
Tb
8
E
m =1
Ch
Chapter
33.2
2 : Memoryless
M
l Modulation
M d l i
Methods
Wireless Information Transmission System Lab.
Institute of Communications Engineering
g
g
National Sun YatYat-sen University
3.2 Memoryless
y
Modulation Methods
/4-DQPSK
Dual-Carrier Modulation (DCM)
Multidimensional Signaling
Orthogonal Signaling
Frequency-Shift Keying (FSK)
Hadamard Signals
Biorthogonal Signaling
Simplex Signaling
Si l Waveforms
Signal
W f
from
f
Binary
Bi
Codes
C d
10
1 m M
, ( M 1) .
Am = 1, 3, 5,
m = 1, 2, M
Ep
M
2E p
m =1
2
A
m=
(12 + 32 + 52 +
1 +3 +5 +
+ ( M 1) 2 ) =
+ ( M 1) =
2
( M 2 1) E p
3
M M 2 1
6
fc : carrier frequency
2
A
Energy of sm(t) : Em = m Eg
2
p (t ) = g (t ) cos(2 f c t )
From 2.1-21
( M 2 1) Ep
3
Eavg
k
=
12
( M 2 1) Eg
6
( M 2 1) Eg
6 log 2 M
Baseband PAM : (t ) = p (t )
( fct )
Bandpass
p
PAM : (t ) = 2 / Eg g (t ) cos(2
Ep
Baseband PAM: sm (t ) = Am p (t ) = Am Ep (t )
Th one-dimentional
The
di
i l vector representation
i off sm(t)
( ) are
Baseband PAM: sm = Am Ep ,
Am = 1, 3, , ( M 1)
Bandpass PAM: sm = Am Eg / 2,
Am = 1, 3, , ( M 1)
Bandpass
p PAM is also called amplitude-shift
p
f keying
y g ((ASK))
13
d mn = || sm sn ||2 =| Am An | Ep
(A
An = 2 )
=| Am An | Eg / 2
12 log 2 M
= 2 Ep = 2 Eg =
Ebavg
2
M 1
Ebavg =
( M 2 1) Eg
6 log 2 M
14
E1= E2 =1
Cross-correlation coefficient = -1
Binary antipodal signaling
15
16
m = 1, 2, , M
= g (t ) cos[2 f c t + 2 (m 1)) / M ]
Eg
2k
Eg
2 log 2 M
17
Eb
(3 2-26)
(3.2
26)
Eg
2
cos
(m 1) 1 (t ) +
sin
i
(m 1) 2 (t )
2
2
M
Eg
sm =
cos
(m 1) ,
sin
(m 1)
2
M
M
2
18
M=2, BPSK
BPSK=Binary
y PAM
The mapping is not unique and Gray coding is preferred
A variant of four-phase
four phase PSK (QPSK), called /4
/4-QPSK,
QPSK, is
obtained by introducing an additional /4 phase shift.
M=4, QPSK
19
M=8, 8-PSK
d mn = || sm sn ||2 = Eg 1 cos
( m n)
M
2
= Eg 1 cos
=
2
E
sin
i
g
M
M
2
= 2 log
l 2 M sin
i
Eb
M
sin(( / M ) ( / M )
For large
g M
d min 2
2 log 2 M
M
Eb
20
1 cos 2
2
2sin 2 = 1 cos 2
sin 2 =
Eg
2 log 2 M
Eb
( 3.2-26 )
3.2--3 Q
3.2
Quadrature Amplitude
p
Modulation
m = 1,2, ,M
sm (t ) = Re rm e jm g ( t ) e j 2 fct = rm g ( t ) cos(2 f c t + m )
2
rm = Ami2 + Amq
and m = tan 1 Amq Ami
21
3.2--3 Q
3.2
Quadrature Amplitude
p
Modulation
Vector representation
p
of sm((t):
)
m = 1, 2,..., M
2
)( Ami2 + Amq
)
Signal
g energy:
gy Em = sm = ( Eg / 2)(
Euclidean distance between signal points
d mn =
sm sn
= (
Eg
2
((3.2-39))
3.2--3 Q
3.2
Quadrature Amplitude
p
Modulation
23
3.2--3 Q
3.2
Quadrature Amplitude
p
Modulation
1 Eg
M
M
2
2
Eavg =
(
A
+
A
m
n)
m =1 n =1
M 2
Eg 2 M ( M 1) M 1
=
Eg
=
2M
3
3
M 1
Ebavg =
Eg
3l 2 M
3log
d min =
6 log 2 M
Ebavg
M 1
d min = 2 Eg
24
n =1
= 2n 1 M
n =1
) = ( 2n (1 +
2
n =1
= 4
1
=
3
))
( A
m =1 n =1
+ An
n =1
n =1
) =
M
m =1
25
i =1
N ( N + 1) ( 2 N + 1)
6
i =1
i=
)+
M +1
2
)(
M 1
1
= M Am 2 + M M
3
m =1
2
= M ( M 1)
3
M
N ( N + 1)
1
M Am 2 + M
3
i =
) n + (1 + M )
M ( M + 1) ( 2 M + 1)
4 (1 + M )
6
M ( M + 1) ( M 1)
= 4 n 2 4 1 + M
n =1
M 1+ M
M +1
)(
M 1
M +1
3.2--3 Q
3.2
Quadrature Amplitude
p
Modulation
PAM : Am is real,
and Am = 1, 3, , ( M 1) ; N=1
j 2 ( m 1) / M
PSK : Am is complex, and Am = e
; N=2
QAM: Am is complex, and Am = Ami + jAmq
; N=2
both amplitude and phase carry information
(bit)
(symbol)
26
Comparison
p
of PAM, PSK, and QAM
Q
27
Memoryless
y
Modulation Methods
28
Memoryless
y
Modulation Methods
29
Memoryless
y
Modulation Methods
Memoryless
y
Modulation Methods
Memoryless
y
Modulation Methods
The normalization factor KMOD = 10-1/2 is used for the dualcarrier modulation
modulation.
An approximate value of the normalization factor may be used,
as long as the device conforms to the modulation accuracy
requirements.
32
Memoryless
y
Modulation Methods
Dual-Carrier Modulation (DCM)
33
Memoryless
y
Modulation Methods
Dual-Carrier Modulation (DCM) Encoding Table
34
Frequency Domain:
May use both time and frequency domains to jointly transmit Ndimensional vector
35
36
Orthogonal
g
Signaling
g
g
1 m, n M
s1 = ( E , 0, 0,..., 0))
s2 = (0, E , 0,..., 0)
E
log 2 M
d mn = 2 E
d min = 2 E
sM = (0, 0,..., 0, E )
= 2 log 2 MEb
37
FrequencyFrequency
q
y-Shift Keying
y g (FSK)
(
)
1 m M ,0 t T
= 2 E / T cos(2 f c t + 2 mft )
To keep
k
the
h orthogonality
h
li among signals,
i l for
f mn
*
sm (t ) sn (t )dt = 0 Re[ sml
(t ) snl (t )dt ] = 0
0
f has to satisfy the above condition
(2.1 26) x , y =
38
x (t ) , y (t )
Ex E y
= Re xl , yl
FrequencyFrequency
q
y-Shift Keying
y g (FSK)
(
)
2 E T j 2 ( m n ) ft
sml (t ), snl (t ) =
e
dt
0
T
2 E sin( T (m n)f ) j T ( m n ) f
=
e
T (m n)f
2 E sin( T (m n)f )
cos(( T (m n)f )
T (m n)f
2 E sin(2 T (m n)f )
sin
=
sinc =
2 T (m n)f
= 2 E sinc(2T (m n)f )
Re
sml (t ), snl (t ) =
{ m((t)}
{s
)} is orthogonal
g
sinc(2T(mn)f
(
(
) f ))=0,, for all m n
If f = k / 2T , k is a positive integer, sinc(2T (mn)f )=0
Minimum frequency separation to guarantee orthogonality
f = 1/ 2T
39
2 E T j 2 ( m n ) ft
sml (t ), snl (t ) =
e
dt
0
T
=
j 2 ( m n ) ft
2E
e
T j 2 ( m n ) f
2 E e j 2 ( m n )fT 1
=
T j 2 ( m n ) f
j ( m n ) fT
j ( m n ) fT
j ( m n ) fT
e
e
e
2E
=
T
j 2 ( m n ) f
2 E sin(( T (m n)f ) j T ( m n ) f
=
e
T (m n)f
40
)
e j e j
sin =
2j
Hadamard Signals
g
Hn
H n +1 =
Hn
1 1
H1 =
1 1 1 1
1 1 1 1
H2 =
1 1 1 1
1 1 1 1
Hn
H n
1
1
H3 =
1
1
1
1
41
1
1
1 1
1 1
1 1
1 1
1 1 1 1 1
1 1 1 1 1
1 1 1
1 1
1 1 1 1 1
1 1 1 1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
Hadamard Signals
g
Hadamard matrices:
Symmetric
All rows are orthogonal
s2 = [ E
s3 = [ E
E]
E
E]
E]
s4 = [ E E E
E]
The set of signals may be used to modulate 4-D orthonormal basis
4
sm ( t ) = smjj j ( t ) , 1 m 4
j =1
Biorthogonal
g
Signaling
g
g
43
Simplex
p Signaling
g
g
s
m =1
Simplex
p Signaling
g
g
M =4
45
Comparisons
p
This
hi is
i in
i contrast to PAM,
A PSK,
S andd QAM
QA systems.
For fi
F
fixed
d Eb, the
th minimum
i i
distance
di t
in
i these
th
systems
t
increases
i
with increasing M.
46
Signal
g Waveforms from Binaryy Codes
cmN ],
m = 1, 2,..., M
Tc = T/N
Ec = E/N
sm 2
smN ], m = 1, 2,..., M
f all
ll m andd j
smj = E / N , for
47
Signal
g Waveforms from Binaryy Codes
Block length = N
Dimension of M waveforms = N
2N possible waveforms from 2N possible binary code words
2N signal points vertices of N-dim. hypercube w. center at origin
May select M < 2N signal waveforms for transmission
Cross-correlation depends on how to select M waveforms
Cross-correlation coefficient of adjacent points:
E (1 2 / N ) N 2
=
=
E
N
Minimal distance:
d min = 2 E (1 ) = 4 E / N
48
49
Signaling
g
g Schemes with Memory
y
NRZ: (Non-return-to-zero)
NRZI: (Non
(Non-return-to-zero
return to zero, inverted)
1: A
0 -A
0:
A
Equivalent to a binary PAM or s BPSK signal.
0: amplitude unchanged
1: amplitude transit to another
Delay modulation:
0: No delay
1 Si
1:
Signall ddelayed
l d bby T/2
50
Signaling
g
g Schemes with Memory
y
Differential encoding: bk = ak bk 1
Modulation with memory
T
Two-state
M k chain
Markov
h i
If P[ak=1] = P[ak=0] = 1/2,
1/ 2 1/ 2
P=
1/
2
1/
2
If P[ak=1] = 1P[ak=0] = p,
p
1 p
P=
p
1
CPFSK
52
CPFSK
j 4 Tf d
d ( ) d +0
(t ) = 2 E / T e
fd : peak frequency deviation
0: initial phase of the carrier
(bandpass signal)
(t ; I ) = 4 Tf d d ( )d = 4 Tf d I n g ( nT ) d
53
CPFSK
n 1
k =
+ 4 f d Tq (t nT ) I n
= n + 2 hI n q (t nT
T)
t<0
0
q (t ) = t / (2T )
0t T
1/ 2
t>T
n 1
=h
l ti (memory)
(
) off symbols
b l up to
t t = nT
T
k = I k: accumulation
n
(n-1)th symbol
h=2f T
:
modulation
index
d
54
Continuous--Phase Modulation
Continuous
I h q(t kT ),
k =
k k
nT t (n + 1))T
Continuous--Phase Modulation
Continuous
Full-response CPM
LREC, L=1,
results in
CPFSK
LRC, L=1
Partial-response
p
CPM
LRC, L=2
LREC, L=2
1
2 LT
2LT
1
g (t ) =
2 LT
2 t
1 cos
, 0 t LT
LT
56
0 t LT
Continuous--Phase Modulation
Continuous
ln 2
57
Continuous--Phase Modulation
Continuous
58
Continuous--Phase Modulation
Continuous
: partialresponse CPM
with LRC, L=3
When h=m/p, m and p are relative prime, for full response CPM signal:
m 2 m
( p 1) m
s = 0,
0
,
,...,
, when m is even
P
p
p
m 2 m
(2 p 1) m
s = 0,,
,
,,...,,
, when m is odd
P
p
p
59
Continuous--Phase Modulation
Continuous
St = 4
Not the real phase trajectory,
only represents phase at t = nT
Minimum--Shift Keying
Minimum
y g (MSK)
(
)
h =1/2
g(t) is rectangular pulse with duration T
(t ; I ) = 2 f d T
n 1
+ 4 f d Tqq (t nT ) I n
1 n 1
n 1
= h k = I k + 2 hI n q(t nT )
(t ; I ) = I k + I n q(t nT )
2 k =
1
t nT
),
= n + I n (
nT t (n + 1)T
2
T
k =
Th modulated
The
d l t d carrier
i signal
i l is
i (see
(
3.3-8)
3 3 8)
1
t nT
s (t ) = A cos 2 f c t + n + I n
2
T
1
1
= A cos 2 ( f c +
I n )t n I n + n ,
4T
2
61
nT t (n + 1)T
Minimum--Shift Keying
Minimum
y g (MSK)
(
)
si (t ) = A cos 2 fi t + n + n (1))i 1 ,
2
i = 1,, 2
1
Equivalent to a FSK signal with f = f 2 f1 =
2T
2T
I FSK
In
FSK, minimum
i i
ffrequency separation
i to ensure orthogonality
h
li off
1
the signals is f = 2T
Thus binary CPFSK with h=1/2
Thus,
h 1/2 is called minimum-shift keying
62
Offset Q
QPSK ((OQPSK)
Q
)
01: E / 2(1 + j )
11: E / 2(1 + j )
Phase transition
occurs at 2nTb
63
Offset Q
QPSK ((OQPSK)
Q
)
Offset Q
QPSK ((OQPSK)
Q
)
n =
n =
sl (t ) = A I 2 n g (t 2nT )
n =
j I 2 n +1 g (t 2nT T )
n =
65
Offset Q
QPSK ((OQPSK)
Q
)
t
g
(
t
)
=
sin
,
With
2T
0 t 2T
66
Offset Q
QPSK ((OQPSK)
Q
)
67
Linear Representation
p
of CPM Signals
g
(t ; I ) = 2 h I k q (t kT ),
k =
n L
= h I k + 2 h
t
k =
k = n L +1
nT t (n + 1)T
I k q (t kT )
L 1
exp[ j (t ; I )] = exp j h I k exp{ j 2 hI n k q[t (n k )T ]}
k =
k =0
nT t (n + 1)T
Cumulated
phase up
p
p to
I n L
68
Linear Representation
p
of CPM Signals
g
exp[ j (t ; I )]
, otherwise
n L
L 1
= exp j h I k {s0 [t + (k + L n)T )] + exp( j hI n k ) s0 [t (k n)T ]}
k =
k =0
69
Linear Representation
p
of CPM Signals
g
n L
L 1
exp[ j (t ; I )] = exp j h I k {s0 [t + ( k + L n)T )] + exp( j hI n k ) s0 [t ( k n)T ]}
k =
k =0
70
Linear Representation
p
of CPM Signals
g
2 L1 1
j hAk ,n
k =0
ck (t nT )
ck (t ) = s0 (t ) s0 [t + (n + Lak ,n )T ],
Ak ,n =
n =1
L 1
I I
m =
m =1
0 t T min[ L(2 ak ,n ) n]
n
n m k ,m
k = 2m 1ak ,m ,
k = 0,1,...,
0 1 2 L 1 1
m =1
72
73
+E
0
-E
One
One is represented by one level.
level
Zero is represented by the other level.
74
+E
0
-E
One
One is represented by a change in level.
level
Zero is represented by a no change in level.
75
+E
0
-E
One
One is represented by a no change in level.
level
Zero is represented by a change in level.
76
+E
0
-E
Unipolar - RZ
One
One is represented by a half-bit
half bit width pulse.
pulse
Zero is represented by a no pulse condition.
77
+E
0
-E
Polar - RZ
One
One and Zero
Zero are represented by opposite
level polar pulses that are one half-bit in width.
78
+E
0
-E
+E
0
-E
Bi--M
i
( Biphase
i h
Markk or Manchester
h
1)
+E
0
-E
+E
0
-E
Dicode Non-Return-to-Zero
82
+E
0
-E
Dicode Return-to-Zero
83
+E
0
-E
Dicode Non-Return-to-Zero
O--
85
86
Line Code:
Code Multilevel Transmission
87
88
Spectral
p
Densities of Various PCM Waveforms
89