Modulation I I

ECNG 6703 - Principles of Communications
Linear Modulation - Modulation, Demodulation, Detection &

Synchronization: Part II
Sean Rocke
November 4
th
, 2013
ECNG 6703 - Principles of Communications 1 / 46
Outline
1
Mary Baseband Pulse Amplitude Modulation
2
Mary Quadrature Amplitude Modulation
3
Maximum Likelihood Detection
4
Modulation Performance
5
Conclusion
Mary Baseband Pulse Amplitude Modulation (PAM)
1Dimensional signal set with basis function
0
(t ) = p(t ), where
p(t ) is any unit energy pulse.
Consider a symbol sequence with a new symbol occurring every
T
s
seconds.
The resulting PAM signal is given by, s(t ) =
n
a(n)p(t nT
s
)
n may be a nite or innite symbol sequence.
Minimum Euclidean distance between any two symbols in symbol
space is 2A.
Baseband PAM Constellation Examples
Question:
The average energy of a signal set is given by E
avg
=
i
p
i
E
i
, where p
i
and E
i
are the probability of occurrence and energy of symbol i ,
respectively. Show that, assuming equiprobable symbols, the average
energy of the general PAM constellation is given by E
avg
=
M
2
1
3
A
2
.
PAM: ContinuousTime Realization
PAM: ContinuousTime Realization
Received signal: r (t ) = s(t ) + w(t ), w(t ) zeromean white
Gaussian noise with PSD
N
0
2
W/Hz
MF output:
x(t ) = r (t ) p(t ) =
_
T
2
+t
T
1
+t
r ()p( t )d
x(t ) =
k
a(k)
_
T
2
+t
T
1
+t
p( kT
s
)p( t )d +
_
T
2
+t
T
1
+t
w()p( t )d
MF output sampled at t = lT
s
:
x(lT
s
) =
k
a(k)r
p
((k l )T
s
) + v(lT
s
) = a(l ) + v(lT
s
)
1
r
p
(mT
s
) =
_
T
2
T
1
p(t )p(t mT
s
)dt =
_
1, m = 0
0, m = 0
2
v(lT
s
) is noise projection in signal space.
Outcome: In signal space the noise term causes the received
signal term to be displaced from the constellation location.
Example: Binary PAM, CT Realization
PAM: DiscreteTime Realization
Received signal after ADC: r (nT) = s(nT) + w(nT)
MF output:
x(nT) = r (nT) p(nT) =
n+
T
2
T
m=n+
T
1
T
r (mT)p(mT nT)
x(nT) =
n+
T
2
T
m=n+
T
1
T
(
l
a(l )p(mT lT
s
)) p(mT nT) +
n+
T
2
T
m=n+
T
1
T
w(mT)p(mT nT)
x(nT) =
1
T
l
a(l )r
p
(lT
s
nT) + v(nT)
MF output after sample rate conversion n = k
T
s
T
:
x(kT
s
) =
1
T
l
a(l )r
p
(lT
s
kT
s
) + v(kT
s
) =
a(k)
T
+ v(kT
s
)
1
v(kT
s
) N(0,
N
0
2T
2
PAM: DiscreteTime Realization
Mary Baseband Quadrature Amplitude Modulation
(QAM)
2Dimensional signal set with basis functions:
1

0
(t ) =
2p(t )cos(
0
t )
2

1
(t ) =
2p(t )sin(
0
t ), where p(t ) is any unit energy pulse.
3
Orthonormal basis functions are 90
0
apart.
At symbol rate,
1
T
s
symbols/s, the general MQAM signal is a pulse
train given by,
s(t ) =
n
a
0
(n)p(t nT
s
)cos(
0
t ) a
1
(n)p(t nT
s
)sin(
0
t )
s(t ) = I(t )
2cos(
0
t ) Q(t )
2sin(
0
t )
1
Inphase: I(t ) =
n
a
0
(n)p(t nT
s
)
2
Quadrature: Q(t ) =
n
a
1
(n)p(t kT
s
)
Symbol energy for the n
th
symbol is
_
T
2
+nT
s
T
1
+nT
s
s
2
(t )dt = a
2
0
(n) + a
2
1
(n)
Baseband MQAM Constellation Examples: MPSK
Points equallyspaced around a circle of radius E
avg
.
Signals have the same energy, and only differ in phase.
Baseband MQAM Constellation Examples: Square
MQAM
Points on equallyspaced square grid. Only exist for
M = 2
2n
, n = 1, 2, . . .
Signal point projections on
0
(t ) &
1
(t ) axes:
A(
M 1), A(
M 3), . . . , A, A, . . . , A(
M 3), A(
M 1).
Average signal energies:
1
M = 4 E
avg
= 2A
2
2
M = 16 E
avg
= 10A
2
3
M = 64 E
avg
= 42A
2
4
General M E
avg
=
2
3
(M 1)A
2
Baseband MQAM Constellation Examples: CCITT
More tolerant to phase jitter than equivalent square QAM
Fallback subset is used when SNR is not high enough to allow
reliable communications.
Can be thought of as APSK constellations.
Baseband MQAM Constellation Examples: minimum
P
e
Constellations
Designed to minimize error probability, P
e
.
Points constrained to lie on a rectangular grid / concentric circles.
Constrained optimization used to minimize P
e
through
maximization of normalized Euclidean distances between points.
Much more complex decision regions than square QAM, so not
frequently used in practice.
QAM Modulator: ContinuousTime Realization
QAM Demodulator: ContinuousTime Realization
MQAM: ContinuousTime Realization
Received signal:
r (t ) = I
r
(t )
2cos(
0
t ) Q
r
(t )
2sin(
0
t ) + w(t )
MF outputs:
x(t ) =
_
T
2
+t
T
1
+t
I
r
()p( t )d + v
0
(t )
y(t ) =
_
T
2
+t
T
1
+t
Q
r
()p( t )d + v
1
(t )
v
0
(t ) and v
1
(t ) are MF outputs due to noise.
MF outputs sampled at t = lT
s
:
x(lT
s
) =
k
a
0
(k)r
p
((k l )T
s
) + v
0
(lT
s
) = a
0
(l ) + v
0
(lT
s
)
y(lT
s
) =
k
a
1
(k)r
p
((k l )T
s
) + v
1
(lT
s
) = a
1
(l ) + v
1
(lT
s
)
v
0
(lT
s
) and v
1
(lT
s
) are noise projections in signal space.
Example: QPSK Modulator, CT Realization
Example: QPSK Demodulator, CT Realization
MQAM: DiscreteTime Realization
Received signal after BPF & ADC:
r (nT) = I
r
(nT)
2cos(
0
n) Q
r
(nT)
2sin(
0
n) + w(nT)
After Direct Digital synthesis mixing:
r (nT)
2cos(
0
n) =
I
r
(nT) + I
r
(nT)cos(2
0
n) Q
r
(nT)sin(2
0
n) + w
0
(nT)
r (nT)
2sin(
0
n) =
Q
r
(nT) + I
r
(nT)sin(2
0
n) + Q
r
(nT)cos(2
0
n) + w
1
(nT)
MF outputs:
x(nT) =
n+
T
2
T
m=n+
T
1
T
I
r
(mT)p(mT nT) + v
0
(nT))
y(nT) =
n+
T
2
T
m=n+
T
1
T
Q
r
(mT)p(mT nT) + v
1
(nT))
Assuming frequency & phase synchronization, MF outputs
after sample rate conversion n = k
T
s
T
:
x(kT
s
) =
1
T
l
a
0
(l )r
p
(lT
s
kT
s
) + v
0
(kT
s
) =
a
0
(k)
T
+ v
0
(kT
s
)
y(kT
s
) =
1
T
l
a
1
(l )r
p
(lT
s
kT
s
) + v
1
(kT
s
) =
a
1
(k)
T
+ v
1
(kT
s
)
1
v(kT
s
) N(0,
N
0
2T
2
Maximum Likelihood (ML) Detection
Scenario:
1
Detector is presented with a series of numbers, r, corresponding to
L
o
transmitted symbols (1 of M constellation points),
a = [a(0) a(1) . . . a(L
0
1)]
T
.
2
True data sequence, a, unknown (i.e., uncertainty about true data
sequence at receiver)
Detection:
1
How do we estimate the transmitted sequence?
Detection Problem:
1
Detection Task: estimating

a is based on observing samples r.
2
Prior symbol sequence probabilities: P(a)
3
Probability transition model: P(r|a)
4
Detection objective: Select candidate sequence that maximizes
P(a|r)
a = arg max
a
{P(a|r)} = arg max
a
{P(r|a)P(a)}
a = arg max
a
{P(a|r)} is actually the Maximum a Priori (MAP)
detection criterion
Requires knowledge of P(r|a) and P(a).
In general P(a) may be unknown
Designer typically assumes symbol sequences are equally likely.
Thus, P(a) =
1
M
L
0
and

a = arg max
a
{P(r|a)} (ML decision rule)
Requires knowledge of P(r|a) only.
Consider observing received signal, r (t ), consisting of L
0
symbols,
each of duration T
s
seconds
Received signal, r (t ) = s(t ) + w(t ), where w(t ) is a zeromean
white Gaussian RP with PSD
N
0
2
W/Hz
Signal sampled every T seconds to get
r (nT) = s(nT) + w(nT), n = 0, 1, . . . , NL
0
1
Assumptions:
1
Phase/frequency/symbol timing synchronization
2
Exactly N samples/symbol interval
Observation/sample vectors:
1
r = [r (0) r (T) . . . r ((NL
0
1)T)]
T
2
s = [s(0) s(T) . . . s((NL
0
1)T)]
T
3
w = [w(0) w(T) . . . w((NL
0
1)T)]
T
IID noise signal samples, w(nT) N(0,
N
0
2T
)
Hence, P(w) =
1
(2
2
)
L
0
N
2
e
1
2
2
NL
0
1
n=0
w
2
(nT)
Symbol vector, a = [a(0) a(1) . . . a(L
0
1)]
T
, where
1
a(k) = [a
0
(k) a
1
(k) . . . a
K1
(k)]
T
2
a(k) S = {s
0
, s
1
, . . . , s
M1
}
The likelihood function,
P(r|a) =
1
(2
2
)
L
0
N
2
e
1
2
2
NL
0
1
n=0
|r (nT)s(nT;a)|
2
The loglikelihood function, (a) = log{P(r|a)}
ML estimates
1

a = arg max
aS
L
0
{(a)}
a = arg max
aS
L
0
{
L
0
1
k=0
|x(k) a(k)|
2
} (for symbol sequence)
2

a(k) = arg max
aS
{|x(k) a(k)|
2
} (for single symbol)
Example: PAM Bandwidth Performance
Consider independent & equallylikely symbols in pulse train
s(t ) =
n
a(n)p(t nT
s
)
PSD given by P
s
(f ) =
E
avg
T
s
|P(f )|
2
, where
1
P(f ) - continuoustime fourier transform of pulse shape p(t )
Pusle shape examples:
1
NRZ - nonreturn to zero
2
RZ - Return to zero
3
MAN - Manchester
4
HS - Half Sine
5
SRRC - SquareRoot Raised Cosine
Pulse shape BW typically of the form BW =
B
T
s
=
BR
b
log
2
M
, where
1
B - constant depending on pulse shape & BW denition adopted
2
R
s
- symbol rate (symbols/s)
3
R
b
- bit rate (bits/s)
4
M - constellation size (symbols)
Pulse Shape Examples
B
abs
: |P(f )|
2
= 0 for f B
abs
B
%:
_
B
%
0
|P(f )|
2
df =

100
_
0
|P(f )|
2
df
-60dB BW: |P(f )|
2
< 10
6
for f B
60dB
Pulse Shape Examples: RC
Pulse Shape Examples: SRRC
Calculating Error Probability
P(E) =
M1
m=0
P(E|a = s
m
)P(a = s
m
)
Typical assumption: equiprobable symbol occurrences
P(a = s
m
) =
1
M
, m = 0, 1, . . . , M 1
P(E) =
1
M
M1
m=0
P(E|a = s
m
)
How to calculate P(E|a = s
m
)?
P(E|a(k) = +A) = 1P(
2A
T
x(kT
s
)) = 1P(
A
T
v(kT
s
)
A
T
)
P(E|a(k) = +3A) = 1P(0 x(kT
s
)
2A
T
) = 1P(
A
T
v(kT
s
))
P(E) =
3
2
Q
_
_
2E
avg
5N
0
_
P
b
(E) =
3
4
Q
__
4E
b
5N
0
_
For Mary PAM:
P(E) = 2
M1
M
Q
__
6E
avg
(M
2
1)N
0
_
P
b
(E) =
2(M1)
Mlog
2
M
Q
__
6log
2
ME
b
(M
2
1)N
0
_
Calculating Error Probability: Union Bound
Useful approximation when decision regions are irregularly
shaped, making the previous approach extremely complicated
Assuming s
0
was transmitted,
P(E|s
0
) = P([
s = s
1
] [
s = s
2
] . . . [
s = s
M1
]|s
0
)
Since probability of union of events is upper bounded by the sum
of the probabilities of the events, P(E|s
0
)
M1
n=1
P(
s = s
n
|s
0
)
Assuming equallylikely symbols,
P(E)
1
M
M1
m=0
M1
n=0
P(
s = s
n
|s
m
)
Each pairwise error probability given by,
P(
s = s
n
|s
m
) = Q
_
d
m,n
2T
v
_
= Q
_
_
d
2
m,n
2E
avg
E
avg
N
0
_
Error Probability Comparison
Spectral Efciency Comparison
Conclusion
Conclusion
We covered:
Modulation & Demodulation Realization
Modulation & Demodulation Performance Evaluation
Your goals for next class:
Continue ramping up your MATLAB & Simulink skills
Work on your CW exercises
Work on HW 4 for submission next week
Q & A
Thank You
Questions????

Modulation I I

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Modulation I I

Enviado por

Direitos autorais:

Formatos disponíveis

ECNG 6703 - Principles of Communications

Linear Modulation - Modulation, Demodulation, Detection &

Você também pode gostar