Outline

Transmitters (Chapters 3 and 4, Source

Coding and Modulation) (week 1 and 2)
Receivers (Chapter 5) (week 3 and 4)
Received Signal Synchronization (Chapter 6) (week 5)
Channel Capacity (Chapter 7) (week 6)
Error Correction Codes (Chapter 8) (week 7 and 8)
Equalization (Bandwidth Constrained Channels) (Chapter
10) (week 9)
Adaptive Equalization (Chapter 11) (week 10 and 11)
Spread Spectrum (Chapter 13) (week 12)
Fading and multi path (Chapter 14) (week 12)

Transmitters (week 1 and 2)
Information Measures
Vector Quantization
Delta Modulation
QAM
Digital Communication System:
Transmitter
Receiver
Information per bit increases
noise immunity increases
Bandwidth efficiency increases
Transmitter Topics
Increasing information per bit
Increasing noise immunity
Increasing bandwidth efficiency
Increasing Noise Immunity
Coding (Chapter
8, weeks 7 and 8)
Increasing bandwidth Efficiency
Modulation of
digital data into
analog waveforms
Impact of
Modulation on
Bandwidth
efficiency


QAM modulation
Quadrature Amplitude Modulation
Really Quadrature Phase Amplitude
modulation
| |
T t
M m
t f t g V
t f t g A t f t g A
e t g jA A t s
m c m
c ms c mc
t f j
ms mc m
c
s s
=
+ =
=
+ =
0
, , 2 , 1
) 2 cos( ) (
2 sin ) ( 2 cos ) (
) ( ) ( Re ) (
2

u t
t t
t
Amplitude and Phase modulation
g(t) is a pulse waveform to
control the spectrum,
e.g., raised cosine


QAM waveforms
To construct the wave forms we need to
know f
c
, g(t), A
mc
, and A
ms
However, we can write s
m
(t) as an linear
combination of orthonormal waveforms:
) ( ) ( ) (
2 2 1 1
t f s t f s t s
m m m
+ =
QAM waveforms
QAM orthonormal waveforms:
t f t g t f
t f t g t f
c
g
c
g
t
t
c
c
2 sin ) (
2
) (
2 cos ) (
2
) (
2
1
=
=
) ( ) ( ) (
2 2 1 1
t f s t f s t s
m m m
+ =
| |
(
(

=
=
2 2
2 1
g
ms
g
mc
m m m
A A
s s
c c
s
}

= dt t g
g
) (
2
c
QAM signal space
QAM wave form can
be represented by just
the vector s
m

(still need f
c
, g(t), and
c
g
to make actual
waveforms)
Signal space
Constellation
determines all of the
code vectors
s
m1
s
m2
Euclidean distance between codes
n m
n m
mn
m m
mn n m n m
n m n m
n n m m n n m m
n m n m
n m
e
mn
s s s s s s s s
s s s s
d
c c
c
c c c c

s s
s
s s s s
s s

=
=
+ =
+ =
+ + + =
+ =
=
) Re(
) Re( 2
2
2 2
) ( ) (
2
2 2
2
2 2 2
2
2
2
1 1 1
2
1
2
2 2
2
1 1
) (
Is the Energy of the signal
Is the cross correlation of the signals
Euclidean distance between codes
Signals of similar energy and highly cross
correlated have a small Euclidean
separation
Euclidean separation of adjacent signal
vectors is thus a good measure of the ability
of one signal to be mistaken for the other
and cause error
Choose constellations with max space
between vectors for min error probability

Rectangular QAM signal space
Minimum Euclidean
distance between
the M codes is?
s
m1
s
m2
Rectangular QAM signal space
Euclidean distance between the M codes is:
) ) ( ) ((
) ) ( ) ((
2
, 2 , 1 , , 2 , 1 , ,
, 2 , 1 , , 2 , 1 , ,
2 2
2 2
) (
n m n m g
ns ms nc mc
g
n m
e
mn
n n n ns n nc
m m m ms m mc
j j i i d
A A A A
d
M j M i dj A di A
M j M i dj A di A
+ =
+ =
=
= = = =
= = = =
c
c
s s


Rectangular QAM signal space
Minimum euclidean
distance between
the M codes is:
s
m1
s
m2
g
e
mn
e
d
d d
c 2
min
) ( ) (
min
=
=
g
d c 2
Channel Modeling
Noise
Additive
White
Gaussian
Contaminated baseband signal
Baseband Demodulation
Correlative receiver
Matched filter receiver
64-QAM Demodulated Data
Bandwidth required of QAM
If k bits of information is encoded in the
amplitude and phase combinations then the
data rate:
T k R / =
Where 1/T = Symbol Rate = R/k
Bandwidth required of QAM
Can show that bandwidth W needed is
approximately 1/T for Optimal Receiver
M
R
k
R
T
W
2
log
1
= = ~
Where M = number of symbols
(k = number of bits per symbol)
Bandwidth required of QAM
Bandwidth efficiency of QAM is thus:

M
W
R
2
log ~
M R/W
64 6
32 5
16 4
8 3
4 2
2 1
Bandwidth required of QAM
M R/W
64 6
32 5
16 4
8 3
4 2
2 1
Actual QAM bandwidth
Consider Power Spectra of QAM
| |
| |
| | )) ( ( ) (
2
1
) (
) ( Re ) (
) ( Re ) (
2
2
c vv c vv ss
f j
vv ss
t f j
f f f f f
e
e t v t s
c
c
+ u + u = u
=
=
t t
t
t | t |
Band-pass signals can be expressed
Autocorrelation function is
Fourier Transform yields Power spectrum in
Terms of the low pass signal v(t) Power spectrum
Actual QAM bandwidth
Power Spectra of QAM
ns nc n
n
n
n
n
jA A I
I
nT t g I t v
+ =
=

=
=
} {
) ( ) ( For linear digital mod signals
Sequence of symbols is
For QAM
Actual QAM bandwidth
) ( ) (
1
) (
) ( ) (
1
) (
) ( ) ( ) (
) ( ) ( ] [
2
1
) (
2
_
*
* *
f f G
T
f
mT m
T
mT nT t g nT t g m
mT t g nT t g I I E
ii vv
m
gg ii vv
m m
ii
n m
m n vv
u = u
=
+ =
+ =

=
t | | t |
t |
t t |
Where
] [
2
1
) (
*
m n n ii
I I E m
+
= |
Time averaging this:
Fourier Transform:
Assume stationary symbols
Actual QAM bandwidth
) ( ) (
1
) (
2
f f G
T
f
ii vv
u = u
G(f) is Fourier transform of g(t)
) ( f
ii
u
is power spectrum of symbols
Actual QAM bandwidth
G(f) is Fourier transform of g(t)

Actual QAM bandwidth
G(f) is Fourier transform of g(t)

Actual QAM bandwidth
) ( f
ii
u
power spectrum of symbols
Determined by what data you send
Very random data gives broad spectrum

Actual QAM bandwidth
| | )) ( ( ) (
2
1
) (
c vv c vv ss
f f f f f + u + u = u
) ( ) (
1
) (
2
f f G
T
f
ii vv
u = u
White noise for random
Symbol stream and QAM?
Channel Bandwidth
3-dB bandwidth
Or your definition and
justification
g(t) =
Modulated 64-QAM spectrum