Ofdm

Multicarrier Modulation and OFDM
Parastoo Sadeghi
Department of Information Engineering
Research School of Information Sciences and Engineering
The Australian National University
Week 10, Lecture 19, 3 October 2006
ENGN4536 Modern Wireless Communication Systems 0
Outline
Multicarrier modulation (MCM) basics
Discrete Multitone (DMT) modulation
Orthogonal frequency-division multiplexing (OFDM)
This is still an active research topic.
We cover the basic ideas...
You will see that the basic concept is simple!
ENGN4536 Modern Wireless Communication Systems 1 / Lecture 19
Main Reference
Chapter 6 of Lee and Messerschmidtt, Digital Communications, Third
Edition, 2004
Please do not request it from the library, or you may not have your future
lecture notes!
You will be asked only what is covered in the notes
The colour pictures are taken from either:
Tutorial on the web: http://www.complextoreal.com
Tutorial on the web: http://www.iec.org/online/tutorials/ofdm/topic04.html
Applications of Multicarrier Modulation
DMT: for Wireline, such as ADSL, VDSL
OFDM: for Wireless, IEEE 802.11a, The IEEE 802.16 WirelessMAN Standard
for Broadband Wireless Metropolitan Area Networks, HDTV, HIPERLAN/2
The Idea
In MCM, we split the data into dierent streams and transmit using separate
sub-carriers
Why Do We Need to Do That?
Data may be lost in one or two sub-carriers, but we do not lose the whole
stream
A clever way to combat frequency-selective channels (either wireline or
wireless)
An Example
The Multicarrier Modulation Idea (1)
Suppose we have a xed channel bandwidth W.
We are free to increase signal dimensionality N if we simultaneously increase
symbol interval T.
Intuitively we are compensating for reduced symbol rate by increasing the
number of symbols per symbol interval.
How do we choose the set of orthogonal pulses as we increase T?
One solution: make the bandwidth of each pulse on the order of 1/2T,
satisfying Nyquist rate.
Then place them at dierent non-overlapping centre frequencies.
As T and N increase, this will make only a small portion of the channel
transfer function over narrower and narrower bandwidth aect each pulse
transmission.
The Multicarrier Modulation Idea (2)
Eventually, for suciently large T the channel transfer function will be
constant over the bandwidth of each pulse.
Therefore, ISI for each pulse will be insignicant.
By proper MCM system design, we can cleverly avoid ISI.
What is Multicarrier Modulation?
Multicarrier modulation is the generic term used for any orthogonal pulse
amplitude modulation (OPAM) where the orthogonal pulses are roughly
localized in the frequency domain.
It includes, as special cases, frequency division multiplexing (FDM) and
orthogonal FDM (OFDM) and discrete multitone transmission (DMT)
Now what is orthogonal pulse amplitude modulation (OPAM)?
Based on our knowledge of modulation, we should be able to understand
OPAM very easily and then move on to MCM.
Orthogonal Pulse Amplitude Modulation (OPAM) (1)
Assume that we have a set of N orthogonal basis functions or pulse shapes
{g
n
(t) : n = 0, , N 1}.
Amplitude modulate each pulse shape with a dierent symbol a
(n)
k
from an
alphabet of size M symbols and send all the pulses simultaneously
We get OPAM as follows (k shows symbol interval index)
s(t) =
k=
N1
n=0
a
(n)
k
g
n
(t kT)
. .
one combined symbol
At each symbol interval of duration T, N (sub) symbols are simultaneously
transmitted using N distinct pulses.
Because the pulse shapes are orthogonal, the superposition of pulses at the
receiver can be sorted out by using a bank of matched lters.
s(t) is the complex-valued baseband envelope of the transmitted signal as
x(t) =
_
(2)Re{s(t)e
j2f
c
t
}
Spectral and Power Eciency of OPAM
The bandwidth requirement is
W = N/T
(For each orthogonal pulse shape we need W
1
= 1/T bandwidth.)
We have M
N
possibilities for each transmitted symbol.
This translates into log
2
(M
N
) bits per symbol
The best spectral eciency is (in bits/second/Hertz)
=
_
log
2
(M
N
)/T
_
/W =
log
2
(M
N
)
WT
=
N log
2
(M)
N
= log
2
(M)
So the spectral eciency is independent of N
The power eciency is also independent of N. Why?
MCM: The First Set of Orthogonal Pulses
g
n
(t) = 1/
_
(T)e
j2nt/T
w(t), n {0, , N 1}
where w(t) is a rectangular pulse of duration T.
Lets verify the orthonormality
m,n
=
_
T
0
g
n
(t)g
m
(t)dt = 1/T
_
T
0
e
j2(nm)t/T
dt =
_
1, m = n
0, m = n
Frequency Domain Representation of G
n
(f)s
w(t) is a rectangular pulse of duration T W(f) a sinc function in
frequency domain with the rst zero crossing at f = 1/T (A in the gure)
e
j2nt/T
in g
n
(t) causes W(f) to be frequency shifted to W(f n/T)
MCM: A Better Set of Orthogonal Pulses (1)
A major advantage of MCM will be that it can be implemented with low
cost by applying a discrete time signal to an ideal D/A converter.
The pulses g
n
(t) cannot be generated in this way. Why?
Solution: Pass g
n
(t) through an A/D and bandlimit it rst (controlled
aliasing)
Then pass the bandlimited signal through a D/A. We get
g
n
(t) = 1/
_
(N)
N1
k=0
e
j2nk/N
p(t kT/N), n {0, , N 1}
MCM: A Better Set of Orthogonal Pulses (2)
where p(t) is an ideal unit-energy reconstruction lter for a sample rate of
N/T:
p(t) =
_
T
N
sin(Nt/T)
t
MCM based on g
n
(t) is called DMT in the context of DSL applications and
OFDM in the context of wireless applications.
Frequency Domain Representation of

G
n
(f)s
So it is clear that g
n
(t) is bandlimited.
What Happens with the New Pulses g
n
(t)
The one-shot OPAM transmitter sends:
s(t) =
N1
n=0
a
(n)
g
n
(t)
Substituting g
n
(t) from previous slides and changing the order of summation
we get
s(t) =
N1
k=0
_
1
N
N1
n=0
a
(n)e
j2nk/N
_
. .
kth inverse DFT coe
p(t kT/N)
where the item in the brackets is the k-th inverse DFT coecient of
{a
(0)
, a
(1)
, , a
(N1)
}, lets call it s
k
New Elegant Representation!
s(t) =
N1
k=0
s
k
p(t kT/N)
This is an interpolation of {s
(0)
, s
(1)
, , s
(N1)
} with the ideal interpolation
lter p(t)
Important: MCM signal s(t) can be generated by a cascade of IFFT and a
D/A convertor with a sample rate of N/T
At the Receiver
We receiver r(t), pass it through a lter matched to g
n
(t). After a few
manipulations we see that
y
n
=
1
N
N1
k=0
r
k
e
j2nk/N
,
where r
k
is the k th output of an ideal A/D converter
Combating ISI with a Cyclic Prex (1)
ISI destroys the orthonormality of pulses, but we can restore this property by
losing a bit of eciency and adding cyclic prex at the transmitter
Let h
k
be the k-th coecient of discrete-time channel impulse response.
We assume that the memory of the channel is : h
k
= 0 for k > . We also
assume that N.
We can write the following convolution
r
k
=
N1
i=0
h
i
s
ki
If we take FFT of the received signal, we are taking FFT of the above linear
convolution.
Unfortunately, FFT of linear convolution of r does not break into the product
of FFTs of h and s.
It only would, if we had circular convolution
Lets write the circular convolution of s and h
x
k
=
N1
i=0
h
i
s
(ki)
N
where (.)
N
is modulo-N operator.
Let H
n
/
N denote the n-th FFT coecient of {h

k
}
With this notion and taking FFT of both sides, we get
X
n
= H
n
a
(n)
With a modication to the modulation format, we can make the ordinary
linear convolution equal to circular convolution.
To see this, lets write x
0
:
x
0
=
N1
i=0
h
i
s
(0i)
N
= h
0
s
(0)
N
+ h
1
s
(01)
N
+ + h
s
(0)
N
= h
0
s
0
..
+h
1
s
N1
+ + h
s
N
. .
?
So we see that in order for x
0
to be equal to the linear convolution of h
and s, we need to append the last samples of sequence s to the start of
sequence s:
s
i
= s
Ni
, 1 i
{s
, , s
1
} is called cyclic prex
Cyclic Prex Representation (1)
Cyclic Prex Representation (2)
Benets of Cyclic Prex
The receiver needs to discard the rst observations corresponding to the
cyclic prex, which also eliminates the ISI from the previous signaling interval
It will base its decisions on the FFT of the remaining samples {r
0
, , r
N1
}
Although {s
, , s
1
} do not convey information, they make receiver
implementation easy, and remove ISI, because
y
n
= H
n
a
(n)
So neglecting noise, the n-th received symbol is the n-th transmitted symbol
scaled by the complex channel gain H
n
.
There is no interference from other pulses.
Disadvantages of Cyclic Prex
The benets come at the price of reduced throughput
Out of the N + transmitted symbols, only N convey information, leading
to a rate loss of
=

N +
Other MCM Disadvantages
For large N, the distribution of the transmitted OPAM signal approaches a
Gaussian distribution.
s(t) =
k=
N1
n=0
a
(n)
k
g
n
(t kT)
. .
one combined symbol
This leads to large peak to average power ratio
System Block Diagram

Ofdm

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Ofdm

Caricato da

Copyright:

Formati disponibili

Multicarrier Modulation and OFDM

N denote the n-th FFT coecient of {h

Potrebbero piacerti anche