OFDM

Adaptive Modulation
Reduction of Peak-to-Average
Power Ratio
Channel estimation
OFDM in frequency selective
fading channel
Puja Thakral
Gupta

Silvija Kokalj-Filipovic

Youngsik Lim

Sadhana

OUTLINE
Introduction to OFDM
Adaptive Modulation
Reduction of Peak-to-Power Average Ratio
OFDM in Frequency Selective Fading
Channel
Channel Estimation
Conclusions

OFDM SYSTEM

Baseband Transmitter

Baseband Ideal Receiver

Adaptive Modulation
In OFDM ,adaptive bit loading algorithms
set the modulation level in each
frequency band such that a predefined
total number of bits are transmitted with
minimum power.Adaptive Modulation
independently optimizes the modulation
scheme to each sub carrier so that
spectral efficiency is maximized,while
maintaining a target Bit Error Rate(BER).

OFDM Block Structure

With Adaptive Modulation
MODULATOR 1

S/P

MODULATOR 2

DEMODULATOR 1

IFFT

FREQUENCY
SELECTIVE
CHANNEL

MODULATOR N

FFT

DEMODULATOR 2

DEMODULATOR N

CHANNEL
ESTIMATION

ADAPTIVE
BIT AND POWER
ALLOCATION

P/S

Various Algorithms in
Adaptive Modulation
For a given target BER and bit-rate, the

total transmit power can be minimized by

optimally distributing the power and bitrate across the sub channels.
For a given target BER and power
transmitted,the total bit-rate can be
maximized.
For a given target power and bit rate,the
total BER can be minimized.

ALGORITHM
Compute the subchannel signal to noise

ratios.
Compute the number of bits for the ith
subchannel based on the formula,
b`(i)=log2(1+SNR(i))
Round the value of b`(i) down to b(i).
Restrict b(i) to take the values 0,1,2,4,6,8
Compute the energy for the ith subchannel
based on the number of bits initially assigned
to it using the formula e(b(i))=(2^b(i)-1)/SNR

RESULTS

FUTURE WORK
Feasibility study of MIMO OFDM

systems
Simulation of MIMO OFDM system
with adaptive modulation and
multilevel transmit power control.

Peak To Average Power

Ratio
Causes, Effects
and Reduction
in OFDM
Methods

Silv
ija K
oka

lj-F
ilipo
vic

Summary
Goal: reducing maximum output power

to near average power by limiting the

set of transmitted signals through
coding
Complementary Golay Sequences have
peak-to-average power less then 2
Reed-Muller Coding used to produce
these sequences out of information
sequence

Stochastic Structure
In accordance with CLT, when large number of

modulated carriers (N) are combined into a

composite time-domain signal by means of IFFT
(they are assumed to be independent, since the
assigned data symbols are iid (0, 0 )), it leads
to near Gaussian pdf of amplitude, where the
amplitude value exceeds certain threshold
value A with probability Q(A-/), and
~ N0 ~ N0

 Since we have N independent points in the

composite time signal:

For BPSK modulation well have ~ Gaussian
distribution of the amplitude
For MPSK and M-QAM modulations (which
both have 2-dimensional space: I and Q
component ) we have a Rayleigh distribution
(square root of the sum of squares of I & Q
Gaussian random variables).
Cumulative distribution of power: F (z) = 1e-z

Definition of PAPR (PMEPR)

PAPR & PAR: Peak-To-Average Power Ratio
PMEPR: Peak-To-Mean Envelope Power
Ratio
Crest factor of x(t): square root of PAR

Definition: PAR = (||x||)2 / E[(||x||2) 2]

Crest Factor - notation

The crest factor of u(t): square root of PMEPR
where || u || is the maximum absolute value of u(t) and
|| u || 2 is the rms of u(t):

|| u ||
CF (u )
|| u || 2
1

2
|| u || 2
o u (t ) dt
T

1/ 2

Effects of PAPR
The power amplifiers at the transmitter need to have a large

linear range of operation.

nonlinear distortions and peak amplitude limiting introduced
by the High Power amplifier (HPA) will produce intermodulation between the different carriers and introduce
additional interference into the system.
additional interference leads to an increase in the Bit Error
Rate (BER) of the system.
one way to avoid non-linear distortion is by forcing the
amplifier to work in its linear region. Unfortunately such
solution is not power efficient and thus not suitable for
wireless communication.
The Analog to Digital converters and Digital to Analog
converters need to have a wide dynamic range and this
increases complexity.
if clipped, it leads to in-band distortion (additional noise) and
ACI (out-of-band radiation)

Classification of
PAR reduction methods

BLOCK CODING (Golay

sequences)
CLIP EFFECT TRANSFORMATION
PROBABILISTIC TECHNIQUES:

Selective Mapping (SLM) and

Partial Transmit Sequences (PTS)
Tone Reduction (TR) and Tone
Injection (TI)

Representation of OFDM signal

fc f=0
In the bandpass with

the multicarrier (multitone) signal can be

represented
as
N

u (t ) cos(2kf 0t k 1), f 0 1 / T
k 1

k 1

where

corresponds to initial phase of

N 1
the tones, i.e. the
effect
of modulating
j 2 f 0t
j 2 kf 0t k
u (t ) Re e
e
data.

u (t ) Re e

j 2 t / T

k 1

N 1

s e
k 1

j 2 kt / T

Ree

j 2 t / T

S (t )

Representation of OFDM signal

N 1
j 2kt / T
S (t ) sk e s
k 0
assuming t is the frequency and 1/T is the sampling period of sequence s
Fourier
Transform

sk

is the discrete complex sequence of information data (phase-mapped).

Crest factor depends on the maximum absolute value of

the multicarrier signal, and that one depends on the
amplitude spectrum of the complex sequence sk
Observation: OFDM has somewhat inverted logic we are looking for
flat PSD in time domain, while autocorrelation is taken in frequency
domain

Choosing

sk

to be complementary Golay sequence

crest factor of less than 6dB (PAPR of 3 dB) can be obtained

Proof:

Aperiodic correlation Cx(z) of some sequence xi

N 1 z

C x ( z ) xi xi* z
i 0

The Fourier transform Sx(f) of sequence

N 1

S x ( f ) xi e
i 0

j 2 f iTs

| S( f ) |

x
i

C (o)

where Ts is the sampling period of sequence xi

Definition: Two sequences a and

i
form a complementary pair if

C a ( z ) Cb ( z ) 0 , z 0

b of the length N

2 N , z o

Golay complementary sequences have that property.

 N carrier OFDM; H-PSK modulation

N 1 z
N 1
a a
a
j 2 ( f if ) t
Ca ( z )
S a (t ) e
i

i z

i 0

i 0

a ; a
Information-bearing sequence
j

is

in fact an OFDM codeword and is the

primitive H-root of unity (j in QPSK case)
a a H ( i j ) ft
a a Huft
2
P
(
t
)

|
S
(
t
)
|

n
Instantaneous
Envelope Power

a
a
i

u 0 i

i, j

C (u )
u 0

Huft

i u

n 1

n | Ca (u ) | *1 n 2 (n u ) n
u 0

u 1

For complementary sequences:

Pa (t ) Pb (t ) 2n

Pa (t ) 2n

Theory behind Reed-Muller codes

An rth order Reed-Muller code R(r,m) is the set of all binary strings (vectors) of

length n= 2m associated with the Boolean polynomials p(x1, x2, , xm) of

degree at most r.
A Boolean polynomial is a linear combination of Boolean monomials with
coefficients in F2. A Boolean monomial p in the variables x1, x2, , xm is the
expression of the form:
P = x1r1 x2r2 , xmrm where ri {0,1,2..} and 1 i m.
Degree of a monomial is deduced from it reduced form (after rules x ixj = xjxi
and xi2 = xi are applied), and it is equal to the number of variables. This rule
extends to polynomials
Ex. of a polynomial of degree 3:
q = x1+ x2+x1 x2+ x1 x2 x3

How to associate Boolean monomial in m variables to a vector with 2 m entries:

a vector associated with monomial of degree 0 (1) is a string of length 2 m
where each entry is 1.
a vector associated with monomial x1 is 2 m-1 ones followed by 2m-1 zeros.
a vector associated with monomial x2 is 2 m-2 ones followed by 2m-2 zeros,
then another 2m-2 ones followed by 2m-2 zeros.
a vector associated with monomial xi is a pattern of 2 m-i ones followed by
2m-i zeros, repeated until 2m values are defined.

Example of RM generator
matrix
m = 5:

X0:
X1:
X2:
X3:
X4:
X5:

RM(1,5) has six rows

11111111111111111111111111111111
00000000000000001111111111111111
00000000111111110000000011111111
00001111000011110000111100001111
00110011001100110011001100110011
01010101010101010101010101010101

Relationship between Reed-Muller

codes and Complementary Golay
Sequences
In the binary case, Golay pairs and sets occur in the first-order

Reed-Muller code RM(1,m) within the second-order Reed-Muller

code (cosets).

Each coset has assigned coset representative of the form:

2
where

h 1

m 1

x
k 1

(k )

x ( k 1)

is any permutation of the sequence of generator

matrix rows see graph with rows as hypercube vertices

h: number of elements in the Galois field

Simulatio
n

Conclusions and Further Work

Result: complete elimination of clipping
noise
Drawback: serious overhead (low
bandwidth utilization 17/32)
Further work:

implementation of Tone Reservation Algorithm

and Comparison with Golay Sequences
Extension of the method to Golay sequences
that do not form complementary pairs but have
satisfying PAR (coset representatives of different
forms)

Conclusions and Further Work

Result: complete elimination of clipping
noise
Drawback: serious overhead (low
bandwidth utilization 17/32)
Further work:

implementation of Tone Reservation Algorithm

and Comparison with Golay Sequences
Extension of the method to Golay sequences
that do not form complementary pairs but have
satisfying PAR (coset representatives of different
forms)

Cyclic prefix of OFDM in frequency

selective fading channel

Problem Description

Signal distortion in frequency selective fading channel

What is the cyclic prefix ?
How is the interference eliminated with cyclic prefix?
How is its performance without the cyclic prefix.

Transmission over frequency selective fading channel(*)

(t)

x(t )

u (n)h(t nT ) (t )
s

u (n)

Pulse Shaping
Tx

Channel
ch

rc

(t )

x(t )

x(n)

Receive Filter
Rx
t=nTs

h(t ) Tx (t ) ch (t ) Rx (t )
(n)

(n)

u (n)

h(n)

x(n)

U (i )

H0+H1z

-1

X (i )

x(n) h(l )u (n l ) (n)

l 0

(*) Z. Wang, G.B. Giannakis, Wireless Multicarrier Communications. IEEE 2000 Signal Processing Magazine

Channel Model (**)

Channel response
magnitude

Dispersive in time,
Static over block interval
Selective in frequency
0

Ts

2Ts

3Ts

4Ts

5Ts

6Ts

7Ts

8Ts

9Ts

10Ts

time

Black : Average , Gray : a realization of the channel

hi N (0, 12 k2 ) jN (0, 12 k2 )

hi : Channel impulse response of ith block

k2 02 e kT

k2 : Variance of kth complex sample

02 1 e T

/ TRMS

/ TRMS

(**) Frequency selective Flat fading channel(Naftali Chayat in IEEE P802.11-97/96)

What is H0 and H1?

X (i ) H 0U (i ) H1U (i 1) (i )

x0 hLu L hL 1u L 1 h0u0 0
L

xk hnu k n
n0

x1 hLu L 1 hL 1u L 2 h0u1 1

U (i ) : ith transmitted block

U (i 1) : (i - 1)th transmitted block
X(i ) : ith received block
(i ) : noise vector

xL hL u0 hL 1u1 h0u L L

x N 1 hL u L hL 1u L 1 h0u N 1 N 1
hL

X HU , H

hL 1 h0
hL

hL 1 h0

0
0

0
0
0
hL hL 1 h0

h0

H 0 hL

h0

hL h0

N+L
Memory
from the
past
block

0 hL

0
H1 0

0 0

h1

hL

How is IBI deleted ?

(i )
U (i )

Tcp

H0+H1z-1

X (i ) H (i )U (i ) (i )

Rcp

h0

X (i ) Rcp H 0TcpU (i ) Rcp H1TcpU (i 1) Rcp (i )

Rcp H 0TcpU (i ) (i )
H (i )U (i ) (i )
Tcp : [ I cpT I NT ]T , Guard - inserting matrix , (N L) N
I cp : Last L rows of an N N identity matrix I N
Rcp : [0 N L I NT ]Guard - discarding matrix, N ( N L)

H (i ) hL

hL

h0

h1

hL

hL h0

F H F 1 diag[ H (e j 0 ), H (e j 2 / N ), , H (e j 2 ( N 1) / N )]

H (i ) becomes a circulant matrix

Fk ,n N 1/ 2 exp( j 2kn / N )
L

H (e j 2f ) h(n) exp( j 2fn)

n 0

Cyclic prefix effect on OFDM

OFDM
S (i )

Input
bits
S/P

.
.
.

(i )

Mapping

.
.
.

IFFT

U (i )

.
.
.

FFT

.
.
.

Demapping

.
.
.

P/S

X (i ) H (i )U (i ) (i )

F X (i ) F H (i )U (i ) (i ) F H (i ) F 1S (i ) F (i ) S (i ) F (i )

No IBI plus simpler equalizer

Output
bits

 Simulation configuration
Perfect channel estimation , QPSK, Fixed sub-channel power
Zero Forcing equalization
64 sub-carriers

Simulation Results

Evaluation of Pilot-symbol based channel estimation

Guard

Bit
mapping

IFFT

Random
bits

Channel

FFT

compensation

Bits

Symbolto-bit
mapping

Pilot extraction
Channel
estimation and
interpolation

insertion

Guard
extraction

Multipath
channel
model

Tapped
delay line
H(n)

AWGN

Naftali Multipath Channel Model

Magnitude

Ts

2Ts 3Ts 4Ts

5Ts 6Ts 7Ts 8Ts 9Ts

hk = N(0, 1/2k2) + jN(0,1/2k2)

k2 = 0 e-kTs/TRMS
02 = 1 e Ts/TRMS

Time

Channel Estimate:
He = Yp/Xp k = 0,1,2,3
Interpolation techniques:
1. Linear based on responses of 2 neighbouring pilots placed at p1 and p2
He(k) = (Hp(m+1) Hp(m)) *l/L + Hp(m)

p1<k<p2, l = k-p1

2. Second order based on 3 neighbouring pilots placed at p1, p2 and p3

He(k) = c1*Hp(m-1) + c0 * Hp(m) + c-1*Hp(m+1)
C1 = ( k-p2)* (k-p3)/ ((p1-p2)*(p1-p3))
C2 = (k-p1) *(k-p3)/ ((p2-p1) * (p2 p3))
C3 = (k-p1)*(k-p2)/ ((p3-p1) * (p3-p2))

802.11a Pilot subcarrier placement

-21

-7

Subcarrier
numbers -31 to 32

21

Pilot subcarrier placement used

L=

14

22

21

14

43

57

64

Subcarrier
numbers 1 to 64

BER Performance in AWGN

Constellation in AWGN

Frequency Selective Fading, Naftali model Trms = 50 ns

Constellation in frequency-selective fading

Selected Results/Plots : Trms = 30ns, Modulation : QPSK

1. Linear interpolation
SNR = 35db

2. Second order interpolation SNR = 30db

3. Cubic spline interpolation ,

SNR = 20dB

Eb/No vs BER in multipath channel

Conclusions and
future work:
Low pass filtering interpolation shows best performance among evaluated
interpolation methods as reported in literature, especially for larger values of
Trms.
Future work:
Evaluation of performance of differential modulation
Evaluation with Doppler frequency shift

Primary Reference:
Channel Estimation Techniques based on Pilot Arrangement in OFDM
Systems
Coleri, et al, IEEE Transactions on Broadcasting, p223

- 229 September 2002