Вы находитесь на странице: 1из 46

Lecture 04

Pengantar OFDM
EL5067 Sistem VLSI Untuk
Komunikasi Digital
2
What is OFDM?
OFDM
=Orthogonal Frequency Division Multiplexing

Many orthogonal sub-carriers are multiplexed
in one symbol
What is the orthogonal?
How multiplexed?
What is the merit of OFDM?
What kinds of application?
3
Why OFDM is getting popular
State-of-the-art high bandwidth digital communication
start using OFDM
Terrestrial Video Broadcasting in Japan and Europe
ADSL High Speed Modem
WLAN such as IEEE 802.11a/g/n
WiMAX as IEEE 802.16d/e

Economical OFDM implementation become possible
because of advancement in the LSI technology
4
Brief history of OFDM
First proposal in 1950s
Theory completed in 1960s
DFT implementation proposed in 1970s
Europe adopted OFDM for digital radio
broadcasting in 1987
OFDM for Terrestrial Video broadcasting in
Europe and Japan
ADSL, WLAN(802.11a)
5
Digital Modulation Basics
Digital modulation modulates three
parameters of sinusoidal signal.
A,
k
fc,


Three type digital modulation:
ASK : Amplitude Shift Keying
PSK : Phase Shift Keying
FSK : Frequency Shift Keying
s t A f t
c k
( ) cos( ) = + 2t u
OFDM uses combination of ASK and PSK such as QAM, PSK
6
Symbol Waveform
1 0 1 0 0
Digital Information
carrier
ASK
PSK
FSK
Symbol
length
7
Multi bit modulation
1 0 1 0 0
carrier
BPSK
1bit per symbol
QPSK
2bit per symbol
10
11 01 00 01
Symbol
length
8
Mathematical Expression
of Digital Modulation
Transmission signal can be expressed as follows
s(t) can be expressed by complex base-band signal
] ) Re[( ) (
sin , cos
) 2 sin( sin ) 2 cos( cos
) 2 cos( ) (
2 t fc j
k k
k k k k
c k c k
k c
e jb a t s
b a
t f t f
t f t s

+ =
= =
=
+ =
t
u u
t u t u
u t


( ) a jb e
k k
j fc t
+
2t
( ) a jb
k k
+
e
j fc t 2t
Indicates carrier sinusoidal
Digital modulation
Digital modulation can be expressed by the complex number
9
Constellation Map
(a
k
+ jb
k
) is plotted on I(real)-Q(imaginary) plane
Data
a
k
b
k
00 /4
01 3 /4
11 5 /4
10 7 /4
1
2
1
2

1
2

1
2

1
2

1
2
1
2
1
2
QPSK
I
Q
10
Quadrature Amplitude Modulation (QAM)
I
Q
I
Q
16QAM 64QAM
11
Summary of Digital Modulation
Type of modulation: ASK,PSK,FSK,QAM
OFDM uses ASK,PSK,QAM
Digital modulation is mathematically characterized by
the coefficient of complex base-band signal



Plot of the coefficients gives
the constellation map
( ) a jb
k k
+
I
Q
12
Frequency Division Multiple Access (FDMA)
Old conventional method (Analog TV, Radio etc.)
Use separate carrier frequency for individual
transmission
Radio
frequency
f

f
2
f
3
f
N
Carrier frequency
Occupied BW
Channel
separation
Guard band
13
Multi-carrier modulation
Use multiple channel (carrier frequency) for
one data transmission
data
cos( ) 2
1
tf t
cos( ) 2
2
tf t
cos( ) 2tf t
N
cos( ) 2
1
tf t
cos( ) 2
2
tf t
cos( ) 2tf t
N
LPF
LPF
LPF
data
D
E
M
U
L
T
I
P
L
E
X

M
U
L
T
I
P
L
E
X

14
Spectrum Comparison
frequency
Single carrier
frequency
OFDM
frequency
Multi carrier
15
OFDM vs. Multi Carrier
OFDM is multi carrier modulation
OFDM sub-carrier spectrum is overlapping
In FDMA, band-pass filter separates each
transmission
In OFDM, each sub-carrier is separated by DFT
because carriers are orthogonal
Condition of the orthogonality will be explained later
Each sub-carrier is modulated by PSK, QAM
Thousands of PSK/QAM symbol can be
simultaneously transmitted in one OFDM symbol
16
OFDM Carriers
OFDM carrier frequency is n1/T
Symbol period T
cos( ) 2 1
0 1
t u + f t
T
f
1
0
=
cos( ) 2 2
0 2
t u + f t
cos( ) 2 3
0 3
t u + f t
cos( ) 2 4
0 4
t u + f t
cos( ) 2 5
0 5
t u + f t
cos( ) 2 6
0 6
t u + f t
17
Sinusoidal Orthogonality
m,n: integer, T=1/f
0

cos( ) cos( )
( )
( )
sin( ) sin( )
( )
( )
cos( ) sin( )
2 2
2
0
2 2
2
0
2 2 0
0 0
0
0 0
0
0 0
0
t t
t t
t t
mf t nf t dt
T
m n
m n
mf t nf t dt
T
m n
m n
mf t nf t dt
T
T
T
=
=
=

=
=
=

=
}
}
}




Orthogonal
Orthogonal
Orthogonal
18
A Sub-carrier of f=nf
0
Amplitude and Phase will be digitally modulated
n
n
n n n n
n n
a
b
t nf b a
t nf b t nf a
1
0
2 2
0 0
tan ), 2 cos(
) 2 sin( ) 2 cos(

= + + =

| | t
t t
@
n cycles
t=0 t=T
Time
19
Base-band OFDM Signal
{ }
s t a nf t b nf t
B n n
n
N
( ) cos( ) sin( ) =
=

2 2
0 0
0
1
t t

n=0
n=1
n=2
n=3
n=4
n=5
n=6
s
B
(t)
20
Demodulation Procedure
According to the sinusoidal orthogonality, a
n
,b
n
can be extracted.
In actual implementation, DFT(FFT) is used
N is roughly 64 for WLAN, thousands for Terrestrial Video
Broadcasting
{ }
{ }
s t kf t dt
a nf t kf t dt b nf t kf t dt
T
a
s t kf t dt
T
b
B
T
n n
T T
n
N
k
B k
T
( ) cos( )
cos( ) cos( ) sin( ) cos( )
( ) sin( )

=
=
=
}
} }

}
=

2
2 2 2 2
2
2
2
0
0
0 0 0 0
0 0
0
1
0
0
t
t t t t
t
How a
n
,b
n
are calculated from s
B
(t)

21
Pass-band OFDM Signal
S
B
(t) is upcoverted to pass-band signal S(t)
f
c
frequency shift
{ } { } | |

=
+ + =
1
0
0 0
) ( 2 sin ) ( 2 cos ) (
N
n
c n c n
t nf f b t nf f a t s t t
22
Actual OFDM Spectrum
f

(-1)

f

(+1)

23
OFDM Power Spectrum
Total Power spectrum is almost square shape
24
OFDM Signal Generation
Direct method needs
N digital modulators
N carrier frequency generator
Not practical
In 1971, method using DFT is proposed to
OFDM siganal generation
{ } { }
| |
s t a f nf t b f nf t
n c n c
n
N
( ) cos ( ) sin ( ) = + +
=

2 2
0 0
0
1
t t
25
OFDM Signal Generation in Digital Domain
Define complex base-band signal u(t) as follows
Perform N times sampling in period T
| |
s t u t
u t d e d a jb
B
n
j nf t
n
N
n n n
( ) Re ( )
( ) ,
=
= = +
=

2
0
1
0
t

u
k
Nf
d e d e
d e k N
n
j nf
k
Nf
n
N
n
j
nk
N
n
N
n
j
N
nk
n
N
0
2
0
1
2
0
1
2
0
1
0
0
0 1 2 1
|
\

|
.
|
= =
=
|
\

|
.
|
=
=

t
t
t
( , , , , )
u(k) = IFFT (d
n
) = IFFT(a
n
+ jb
n
)
26
OFDM Modulator
M
A
P
S
/
P
I-DFT
P
/
S
Real
cos( ) 2tf t
C

generated
0
~d


AIR
Bit
stream
Imag
sin( ) 2tf t
C
27
OFDM Demodulation
{ } { } | |
{ } ) (
2
1
) 2 sin( ) 2 cos(
2
1
)] 2 cos( ) ( [
) ( 2 sin ) ( 2 cos ) (
1
0
0 0
1
0
0 0
t s t nf b t nf a t f t s LPF
t nf f b t nf f a t s
I
N
n
n n C
N
n
c n c n
= =
+ + =

=
t t t
t t
{ } { } ) (
2
1
) 2 cos( ) 2 sin(
2
1
] ) 2 sin( ) ( [
1
0
0 0
t s t nf b t nf a t f t s LPF
Q
N
n
n n C
= + =

=
t t t
u t s t js t d e
I Q n
j nf t
n
N
( ) ( ) ( ) = + =
=

2
0
1
0
t
d
n
= FFT(u(k))
28
Simple OFDM Demodulator
T
u
n
e
r
S
/
P
DFT
P
/
S
A
/
D
LPF
Channel
cos( ) 2tf t
C
/2
LPF
D
E
M
A
P
Bit
Stream
29
Summary of OFDM signal
Each symbol carries information
Each symbol wave is sum of many sinusoidal
Each sinusoidal wave can be PSK, QAM
modulated
Using IDFT and DFT, OFDM implementation
became practical
Time
Symbol period
T=1/f


30
Multi-path
Delayed wave causes interference
Base St at ion
Mobile
Recept ion
Pat h 2
Pat h 3
Direct Pat h
Building
31
Multi-path Effect
Inter symbol interference (ISI) happens in Multi-path condition
T=1/f

Symbol k Symbol k-1 Symbol k+1
Sampling Period
No multi-path
Sampling Period
Multi-path
Direct
Delayed
32
Guard Interval T
g
By adding the Gurard Interval Period, ISI can be
avoided
OFDM symbol(1/f
0
)
Copy signal
T
g
T
g
Direct
Delayed
OFDM symbol (1/f
0
) T
g
Sampling Period
33
Multi-path
By adding GI, orthogonality can be maintained
However, multi-path causes amplitude and
phase distortion for each sub-carrier
The distortion has to be compensated by
Equalizer
34
Features of OFDM
Feature of OFDM
1. High Frequency utilization by the square
spectrum shape
2. Multi-path problem is solved by GI
3. Multiple services in one OFDM by sharing
sub-carriers
4. Implementation was complicated but NOW
possible because of LSI technology progress
35
OFDM Modulator
M
A
P
S
/
P
IFFT
P
/
S
generated
0
~d


Bit
stream
Copy
to make Guard Interval
OFDM symbol (1/f
0
) T
g
36
Multi-path Channel
Base St at ion
Mobile
Recept ion
Pat h 2
Pat h 3
Direct Pat h
Building
OFDM symbol (1/f
0
) T
g
OFDM symbol (1/f
0
) T
g
37
OFDM Demodulator
S
/
P
DFT
Equalize
D
E
M
A
P
Bit
Stream
OFDM symbol (1/f
0
) T
g
P
/
S
Noise
Remove Guard Interval
FFT Matrix
38
| |
|
|
|
|
|
.
|

\
|

|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|

=
|
|
|
|
|
.
|

\
|

=
|
|
|
|
|
.
|

\
|




] 1 [
] 1 [
] 0 [
1
) 1 (
) 1 (
) 0 (
, ;
1
] 1 [
] 1 [
] 0 [
) 1 (
) 1 (
) 0 (
) 1 )( 1 ( ) 1 ( 0
) 1 ( 1 0
0 0 0
) 1 )( 1 (
N x
x
x
W W W
W W W
W W W
N
N X
X
X
column l row k W
N
N x
x
x
FFT
N X
X
X
N N
N
N
N N
N
N N N
N N N
l k
N


N
j
N
e W where
t 2
=
IFFT matrix
39
| |
|
|
|
|
|
.
|

\
|

|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|

=
|
|
|
|
|
.
|

\
|

=
|
|
|
|
|
.
|

\
|


) 1 (
) 1 (
) 0 (
1
] 1 [
] 1 [
] 0 [
, ;
1
) 1 (
) 1 (
) 0 (
] 1 [
] 1 [
] 0 [
) 1 )( 1 ( 1 0
1 1 0
0 0 0
) 1 ( ) 1 (
N X
X
X
W W W
W W W
W W W
N
N x
x
x
column l row k W
N
N X
X
X
IFFT
N x
x
x
N N
N
N
N N
N
N N N
N N N
N
l k


N
j
N
e W where
t 2
=
Multi-path Channel in Matrix
40
Symbol n
Symbol
n-1
GI of n
GI of n-1
If Multi-path Delay is Small than GI Length
Channel Matrix is Cyclic Matrix!
41
Base
Station
Receiver
Two Path Multi-path Channel Example
Channel Impulse Response = [1, 0.5 , 0, 0]
Two path Multi path Channel Example
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|



) 3 (
) 2 (
) 1 (
) 0 (
) 3 ( 0 0 0
0 ) 2 ( 0 0
0 0 ) 1 ( 0
0 0 0 ) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
1
1
1
1 1 1 1
4
1
1 5 . 0 0 0
0 1 5 . 0 0
0 0 1 5 . 0
5 . 0 0 0 1
1
1
1
1 1 1 1
4
1
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
* * *
) 3 (
) 2 (
) 1 (
) 0 (
9
4
6
4
3
4
6
4
4
4
2
4
3
4
2
4
1
4
9
4
6
4
3
4
6
4
4
4
2
4
3
4
2
4
1
4
X
X
X
X
H
H
H
H
Y
Y
Y
Y
X
X
X
X
W W W
W W W
W W W
W W W
W W W
W W W
Y
Y
Y
Y
X
X
X
X
IFFT Channel FFT
Y
Y
Y
Y
If time domain channel matrix is cyclic, Frequency Domain Channel Matrix is
diagonal!
Additive Noise
44
|
|
|
|
|
.
|

\
|
+
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
+
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
(
(
(
(
(

|
|
|
|
|
.
|

\
|
+
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|






) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
) 3 ( 0 0 0
0 ) 2 ( 0 0
0 0 ) 1 ( 0
0 0 0 ) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
1
1
1
1 1 1 1
4
1
) 3 (
) 2 (
) 1 (
) 0 (
1
1
1
1 1 1 1
4
1
1 5 . 0 0 0
0 1 5 . 0 0
0 0 1 5 . 0
5 . 0 0 0 1
1
1
1
1 1 1 1
4
1
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
* * *
) 3 (
) 2 (
) 1 (
) 0 (
9
4
6
4
3
4
6
4
2
4
2
4
3
4
2
4
1
4
9
4
6
4
3
4
6
4
4
4
2
4
3
4
2
4
1
4
9
4
6
4
3
4
6
4
2
4
2
4
3
4
2
4
1
4
N
N
N
N
X
X
X
X
H
H
H
H
Y
Y
Y
Y
noise
noise
noise
noise
W W W
W W W
W W W
X
X
X
X
W W W
W W W
W W W
W W W
W W W
W W W
Y
Y
Y
Y
noise
noise
noise
noise
X
X
X
X
IFFT Channel FFT
Y
Y
Y
Y
How to recover sending signal from receiver signal.
EQUALIZE
45
|
|
|
|
|
.
|

\
|
|
|
|
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
=
|
|
|
|
|
.
|

\
|
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
1
0 0 0
0
) 2 (
1
0 0
0 0
) 1 (
1
0
0 0 0
) 0 (
1
) 3 (
) 2 (
) 1 (
) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
) 3 ( 0 0 0
0 ) 2 ( 0 0
0 0 ) 1 ( 0
0 0 0 ) 0 (
) 3 (
) 2 (
) 1 (
) 0 (
* * *
) 3 (
) 2 (
) 1 (
) 0 (
Y
Y
Y
Y
H
H
H
H
X
X
X
X
Then
X
X
X
X
H
H
H
H
X
X
X
X
IFFT Channel FFT
Y
Y
Y
Y
Noise Ignore
802.11a Transmitter Overview
Controller Scrambler Encoder
Interleaver Mapper
IFFT
Cyclic
Extend
headers
data
IFFT Transforms 64 (frequency domain)
complex numbers into 64 (time domain)
complex numbers
accounts for 85% area
24
Uncoded
bits
One OFDM symbol
(64 Complex Numbers)
Must produce
one OFDM
symbol every 4
sec
Depending
upon the
transmission
rate, consumes
1, 2 or 4 tokens
to produce one
OFDM symbol

Вам также может понравиться