Phil Schniter OSU ECE-702

Managing Complexity [Ch. 15]:

Problem:
Demodulating K
b
bits generally requires O(2
K
b
)
complexity.
For send a xed bit rate, we need O(K
b
) complexity.
Insights:
MPSK only needed one lter for K
b
bits.
; linear modulation.
Gray-coded QPSK demodulated each bit in parallel.
; orthogonal modulation.
1
Phil Schniter OSU ECE-702
Linear Modulation:
I = i x
i
(t) = d
i

E
b
u(t)
Normalization so that average energy per bit = E
b
:

|u(t)|
2
dt = 1

M1
i=0
|d
i
|
2

i
= K
b
(so that avg word energy = K
b
E
b
)
Example constellations:
Q
Q Q
Q
I I I
16-QAM 8-PAM 8-PSK
2
Phil Schniter OSU ECE-702
MLWD for linear modulation (under equal priors):
E
i
= |d
i
|
2
E
b
V
i
(T
p
) =

T
p
0
Y
z
(t)x

i
(t)dt = d

E
b

T
p
0
Y
z
(t)u

(t)dt
. .. .
Q

I = arg max
i
Re{V
i
(T
p
)} E
i
/2
= arg max
i

E
b
Re{d

i
Q} |d
i
|
2
E
b
/2
= arg max
i

Qd
i

E
b

2
= arg min
i

Qd
i

E
b

2
(minimum distance decoder)
Y
z
(t) u

(T
p
t)
t = T
p
Q
decision
device

I
3
Phil Schniter OSU ECE-702
Example decision regions:
Q
Q Q
Q Q
I
I I
I
16-QAM 4-PAM
8-PSK 8-ARY ?
4
Phil Schniter OSU ECE-702
Properties of MLWD with linear modulation:
Only a single lter required.
Decision

I = i inferred when Q decision region A
i
.
Pr

I = i|I = i

= Pr

Q / A
i
|I = i

Notice that
Q

I=i
=

T
p
0

d
i

E
b
u(t) +W
z
(t)

(t)dt
= d
i

E
b
+N
z
(T
p
)

2
N
z
(T
p
)
=

N
0
|U(f)|
2
df = N
0

|u(t)|
2
dt = N
0
,
and so Q

I=i
CN(d
i

E
b
, N
0
).
5
Phil Schniter OSU ECE-702
Exact WEP analysis:
WEP =
1
M
M1

i=0
Pr(Q / A
i
|I = i),
where
Pr(Q / A
i
|I = i) = 1 Pr(Q A
i
|I = i)
= 1

A
i
f
Q|I
(q|i) dq,
so we need to integrate the pdf of Q

I=i
CN(d
i

E
b
, N
0
)
over the decision region A
i
.
6
Phil Schniter OSU ECE-702
Exact WEP for QPSK:

M1
i=0
|d
i
|
2

i
= K
b
|d
i
| =

2 d
i
Q
, d
i
I
= 1.
Q
Q
Q
I
0 1
2 3
3
2
1
0
1
2
3
3
2
1
0
1
2
3
0
0.2
0.4
0.6
0.8
1
3
2
1
0
1
2
3
3
2
1
0
1
2
3
0
0.2
0.4
0.6
0.8
1
Pr(Q / A
0
|I = 0)
= 1

A
0
f
Q|I
(q|0)dq
= 1

0
1
N
0
e

(q
Q

E
b
)
2
+(q
I

E
b
)
2
N
0

dq
Q
dq
I
.
Can decouple this double integral...
7
Phil Schniter OSU ECE-702
Pr(Q / A
0
|I = 0)
= 1

0
1

2(N
0
/2)
e

(q
Q

E
b
)
2
2(N
0
/2)
dq
Q

0
1

2(N
0
/2)
e

(q
I

E
b
)
2
2(N
0
/2)
dq
I
= 1 Pr{Q
Q
> 0}
2
= 1

1 F
Q
Q
(0)

2
= 1

1
2

1
2
erf

E
b

N
0
/2

2
= 1
1
4

1 + erf

E
b
N
0

2
= 1
1
4

2 erfc

E
b
N
0

2
= erfc

E
b
N
0

1
4
erfc
2

E
b
N
0

= WEP (by symmetry).

8
Phil Schniter OSU ECE-702
Exact WEP for some simple linear modulations:
BPSK:
1
2
erfc

E
b
N
0

QPSK: erfc

E
b
N
0

1
4
erfc
2

E
b
N
0

4-PAM:
3
4
erfc

2E
b
5N
0

9
Phil Schniter OSU ECE-702
Exact WEP for some simple linear modulations:
10
Phil Schniter OSU ECE-702
Spectral characteristics of linear modulation:
Since x
i
(t) = d
i

E
b
u(t), we nd that
G
X
i
(f) = |d
i
|
2
E
b
G
U
(f),
and hence
D
X
z
(f) =
1
K
b
M1

i=0

i
G
X
i
(f)
=
E
b
K
b
G
U
(f)
M1

i=0
|d
i
|
2

i
. .. .
K
b
= E
b
G
U
(f)
Note: Energy spectrum depends only on pulse shape u(t).
11
Phil Schniter OSU ECE-702
Summary of linear modulation:
MLWD: Match-lter via pulse shape u(t) and quantize
output Q to nearest constellation point.
Depending on the decision regions, could still be
O(2
K
b
) complexity.
Possible to derive exact WEP by integrating Gaussian
pdfs over the decision regions.
Energy spectrum depends only on pulse shape u(t).
(Later, we discuss good choices for u(t).)
12
Phil Schniter OSU ECE-702
Orthogonal Modulation:
Decoupled ML Bit Decisions:
Recall that this happened with Gray-coded QPSK.
Motivation: gives O(K
b
) complexity MLWD. (Recall
that we need O(K
b
) complexity demodulation to
decode a constant-bit-rate stream.)
Question: Exactly when can MLWD be implemented
using decoupled decisions on each bit?
13
Phil Schniter OSU ECE-702
Say that I = [I
(1)
, I
(2)
, . . . , I
(K
b
)
]. Furthermore, say that
I = i I = [m
1
, m
2
, . . . , m
K
b
].
Claim: If the ML metrics {T
i
} can be written in the form
T
i
=
K
b

k=1
T
(k)
m
k
,
then MLWD is implementable with K
b
decoupled decisions.
I.e., T
i
is maximized by maximizing each T
(k)
m
k
separately:

I = arg max
i
T
i


I =

arg max
m
1
T
(1)
m
1
, . . . , arg max
m
K
b
T
(K
b
)
m
K
b

14
Phil Schniter OSU ECE-702
Example: Gray Coded QPSK:
Bit-to-symbol mapping
d
i
= d
m
1
+ jd
m
2
I = 0 [0, 0] I = 1 [1, 0]
I = 2 [1, 1] I = 3 [0, 1]
Q
I
Q
Q
implies that
T
i
=

E
b
Re{d

i
Q} E
b
(from p. 3)
=

E
b
Re{(d
m
1
jd
m
2
)(Q
I
+jQ
Q
)} E
b
=

E
b
d
m
1
Q
I

E
b
2
. .. .
T
(1)
m
1
+

E
b
d
m
2
Q
Q

E
b
2
. .. .
T
(2)
m
2
.
15
Phil Schniter OSU ECE-702
Generic Orthogonal Modulation:
The k
th
bit chooses between the waveforms in {x
(k)
0
(t), x
(k)
1
(t)},
where {x
(k)
0
(t), x
(k)
1
(t)} {x
(l)
0
(t), x
(l)
1
(t)} for k = l, and then
the sum of waveforms for bits k {1, . . . , K
b
} is transmitted.
In other words, if I = i = [m
1
, m
2
, . . . , m
K
b
], then
x
i
(t) =
K
b

k=1
x
(k)
m
k
(t), where
0 = Re

x
(k)
m
k
(t)x
(l)
m
l
(t)dt m
k
, m
l
, k = l.
Can show that this guarantees decoupled ML metrics. . .
16
Phil Schniter OSU ECE-702
T
i
= Re

T
p
0
Y
z
(t)x

i
(t)dt
1
2

T
p
0
|x
i
(t)|
2
dt
= Re

T
p
0
Y
z
(t)

K
b

k=1
x
(k)
m
k
(t)

dt
1
2

T
p
0

K
b

k=1
x
(k)
m
k
(t)

2
dt
=
K
b

k=1
Re

T
p
0
Y
z
(t)x
(k)
m
k
(t)dt
1
2
K
b

k=1
K
b

l=1

T
p
0
x
(k)
m
k
(t)x
(l)
m
l
(t)dt
=
K
b

k=1

Re

T
p
0
Y
z
(t)x
(k)
m
k
(t)dt
1
2

T
p
0
|x
(k)
m
k
(t)|
2
dt

. .. .
T
(k)
m
k
Note: This species exactly how to generate {T
(k)
m
k
} for
orthogonal modulations.
17
Phil Schniter OSU ECE-702
WEP for orthogonal modulation:
We just saw that M-ary MLWD decouples into K
b
MLBDs.
For the k
th
MLBD, we know that
BEP
(k)
=
1
2
erfc

(k)
E
(1, 0)
4N
0

1
2
erfc

E
b
N
o

,
where
(k)
E
(1, 0) =

T
p
0
|x
(k)
1
x
(k)
0
|
2
dt.
Since the probability of a correct word decision equals the
probability of K
b
simultaneously correct bit decisions,
WEP = 1
K
b

k=1

1 BEP
(k)

1
1
2
erfc

E
b
N
o

K
b
18
Phil Schniter OSU ECE-702
Summary of M-ary orthogonal modulation:
MLWD decouples into K
b
MLBDs.
MLWD implementable with O(K
b
) complexity.
WEP analysis reduces to BEP analysis.
Performance is, at best, equal to binary antipodal
signaling, which was far from Shannons bound!
Can construct orthogonal waveforms by time-division,
frequency-division, or code-division. . .
19
Phil Schniter OSU ECE-702
Example 1: Orthogonal Frequency Division Multiplexing:
For the case of one bit per subcarrier,
s
(l)
(t) =

1
T
p
exp

j2f
d
(2l K
b
1)t

t [0, T
p
]
0 t / [0, T
p
]
X
z
(t) =
K
b

l=1
D
(l)
z

E
b
s
(l)
(t)
. .. .
x
(l)
I
(l)
(t)
using BPSK: D
(l)
z
= a(I
(l)
), i.e., a(0) = 1, a(1) = 1.
For orthogonality (i.e., Re

x
(l)
m
l
(t)x
(k)
m
k
(t) = 0), generally
need f
d
=
1
2T
p
, though f
d
=
1
4T
p
suces for real-valued
constellations. Still, we focus on f
d
=
1
2T
p
.
20
Phil Schniter OSU ECE-702
Binary OFDM demodulator:
Y
z
(t)
s
(1)
(T
p
t)
s
(2)
(T
p
t)
s
(K
b
)
(T
p
t)
Q
(1)
Q
(2)
Q
(K
b
)
t = T
p
t = T
p
t = T
p
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Re()

I=0
>
<

I=1
0
Re()

I=0
>
<

I=1
0
Re()

I=0
>
<

I=1
0

I
(1)

I
(2)

I
(K
b
)
BEP identical to that of BPSK. Spectral eciency is
W
b
=
K
b
T
p
bits/sec,
B
T
2f
d
K
b
, f
d
=
1
2T
p
Hz

B
1 bit/sec/Hz
21
Phil Schniter OSU ECE-702
Example 2: Orthogonal Code Division Multiplexing:
For the case of one bit per spreading waveform,
X
z
(t) =
K
b

l=1
D
(l)
z

E
b
s
(l)
(t)
using BPSK D
(l)
z
= a(I
(l)
), i.e., a(0) = 1, a(1) = 1. The
spreading waveforms {s
(l)
(t)}
K
b
l=1
are orthonormal on [0, T
p
]:

1
Tp

1
Tp

1
Tp

1
Tp
s
(1)
(t)
s
(2)
(t)
s
(3)
(t)
s
(4)
(t)
T
p
T
p
T
p
T
p
t
t
Walsh
codes:
22
Phil Schniter OSU ECE-702
Binary OCDM demodulator:
Y
z
(t)
s
(1)
(T
p
t)
s
(2)
(T
p
t)
s
(K
b
)
(T
p
t)
Q
(1)
Q
(2)
Q
(K
b
)
t = T
p
t = T
p
t = T
p
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Re()

I=0
>
<

I=1
0
Re()

I=0
>
<

I=1
0
Re()

I=0
>
<

I=1
0

I
(1)

I
(2)

I
(K
b
)
BEP identical to that of BPSK. Spectral eciency is
W
b
=
K
b
T
p
bits/sec,
B
T

K
b
T
p
Hz

B
1 bit/sec/Hz
23
Phil Schniter OSU ECE-702
Example 3: Binary Stream Modulation:
Could be called orthogonal time-division multiplexing.
X
z
(t) =
K
b

l=1
D
(l)
z

E
b
u

t (l 1)T

using BPSK D
(l)
z
as before. (Note: T
p
= T
u
+ (K
b
1)T.)
The pulse waveform u(t) is orthogonal to its T-shifts.

1
T
u

1
T
u
u(t)
u(t T)
u(t 2T)
u(t 3T)
T
u
T
T
T
T 2T
2T 2T
2T 3T
3T 3T
3T 4T
4T 4T
4T
t
t
24
Phil Schniter OSU ECE-702
Binary stream demodulator:
Y
z
(t) u

(T
u
t)
t = T
u
+ (k1)T
Q
(k)
Re()

I=0
>
<

I=1
0

I
(k)
for k {1, . . . , K
b
}.
BEP identical to that of BPSK. Spectral eciency is
W
b
=
1
T
bits/sec,
B
T

1
T
Hz

B
=
W
b
B
T
1 bit/sec/Hz
Note: In practice, Linear/OFDM/OCDM modulations are
combined with stream modulation.
25
Phil Schniter OSU ECE-702
Combined Orthogonal & Linear Modulation:
Say we have K
b
bits to send over L orthogonal waveforms:
X
z
(t) =
L

l=1
D
(l)
z

E
b
s
(l)
(t)
where {s
(l)
(t)}
L
l=1
are orthonormal and D
(l)
z
is 2
K
b
L
-ary for
each l. We will assume that
E{D
(l)
z
D
(k)
z
} =

K
b
L
k = l
0 k = l
which means that the symbols used on dierent waveforms
are uncorrelated. It also guarantees an energy-per-bit of E
b
.
26
Phil Schniter OSU ECE-702
Spectral Characteristics:
D
X
z
(f) =
1
K
b
E

X
z
(t)e
j2ft
dt

=
1
K
b
E

l=1
D
(l)
z

E
b
s
(l)
(t)e
j2ft
dt

=
E
b
K
b
E

l=1
D
(l)
z
S
(l)
(f)

=
E
b
K
b
L

l=1
L

k=1
E

D
(l)
z
D
(k)
z

S
(l)
(f)S
(k)
(f)
=
E
b
L
L

l=1
G
S
(l) (f)
27
Phil Schniter OSU ECE-702
WEP Analysis:
Since we assume an identical constellation on each
waveform,
WEP = 1

1 WEP
(l)

L
where WEP
(l)
denotes the per-waveform WEP.
28
Phil Schniter OSU ECE-702
Example 1: 2
K
b
L
-ary Stream Modulation
Time-multiplexing of L symbols with K
b
/L bits per symbol:
X
z
(t) =
L

l=1
D
(l)
z

E
b
u

t (l 1)T

.
As before, the pulse waveform u(t) is orthogonal to its
T-shifts. But now T
p
= T
u
+ (L 1)T and D
(l)
z
is a symbol
from a generic 2
K
b
L
-ary constellation (e.g., QAM, PAM,
PSK).
29
Phil Schniter OSU ECE-702
Example 2: 2
K
b
L
-ary OFDM
L subcarriers with K
b
/L bits per subcarrier:
s
(l)
(t) =

1
T
p
exp

j2f
d
(2l L 1)t

t [0, T
p
]
0 t / [0, T
p
]
X
z
(t) =
L

l=1
D
(l)
z

E
b
s
(l)
(t)
. .. .
x
(l)
I
(l)
(t)
Here, D
(l)
z
is a symbol from a generic 2
K
b
L
-ary constellation
(e.g., QAM, PAM, PSK).
30
Phil Schniter OSU ECE-702
For example, there are several ways to transmit 6 bits using
OFDM:
6 sub-carriers with BPSK and f
d
=
1
4T
p
3 sub-carriers with QPSK and f
d
=
1
2T
p
2 sub-carriers with 8-PSK and f
d
=
1
2T
p
What do you expect for the spectral eciencies?
What about the relative WEP performance?
31
Phil Schniter OSU ECE-702
Example 3: Streamed M-ary OFDM
In modern practical systems, the concepts of time
multiplexing (i.e., streaming), frequency multiplexing, and
linear modulation are often combined.
For example, a 1 Mbit block could be transmitted using
1024 consecutive OFDM frames of 256 subcarriers with
16-QAM (i.e., 4 bits) on each subcarrier.
32