OFDM

OFDM DEFINITION
• OFDM = Orthogonal FDM
• Carrier centers are put on orthogonal frequencies
• ORTHOGONALITY - The peak of each signal coincides with
zero crossing of other signals
• Subcarriers are spaced by 1/ Ts

2
Orthogonal Subcarriers Set
Multipath Channel Fading
Single Carrier
Multi Carrier
Multi Carrier
Modulator

k (t)

13
Demodulator

14
OFDM is a Block Process

15
 Discrete Time Equivalent
• Inverse Discrete Fourier Transform 

N -1
s(n) =  dk exp( j 2 k n/N)
k=0

– N-point IDFT  N2 complex multiplications

• Inverse Fast Fourier Transform

– Radix 2 N-point IFFT  (N/2). log2 N
– Radix 4 N-point IFFT  (3/8). N. ( log 2 N - 2)

16
IFFT/IDFT
OFDM – Tx and Rx Block
Inter Symbol Interference and Cyclic Prefix
Guard Period
Cyclic Prefix
Link Adaptation
Multi Carrier - OFDM
Multi Carrier Spread Spectrum
OFDM
BLOCK DIAGRAM
 Transmitter
• Scrambler scrambles the data to reduce the
probability of long sequences of zeros or ones. Input
data is first scrambled using the same length-127
pseudo-noise scrambler that is used in IEEE802.11a.
• Coder: enable error correction, Convolution code.
Highly secure, More bits are corrected.
Code rate= Message bits/code bits
Code bits= (number of register+ message bits – 1).
• Puncturing Pattern
 Cont….
• Interleaver interleaves the bits of each spatial stream
(changes order of bits) to prevent long sequences of adjacent
noisy bits.
• Modulator :Constellation mapper maps the sequence of bits
in each spatial stream to constellation points.
QPSK, QAM.
• Pilot Insertion Use to synchronise signal at time extraction .
Inverse discrete Fourier transform (IDFT) converts a block of
constellation points to a time domain block.
• Cyclic prefix insertion is where the insertion of the cyclic
shifts prevents unintentional beam forming.
Pulse Shaping
Peak To Average Power Ratio (PAPR)
 Comparison of OFDM Signal
with Single Carrier Signal
2 2
Amplitude of OFDM Time Domain Signal

Amplitude of OFDM Time Domain Signal

1.5 1.5

1 1

0.5 0.5

0 0
0 100 200 300 400 500 0 100 200 300 400 500
Sample Number Sample Number
(a) OFDM signals in time domain (b) Single carrier signal in time domain
Amplitude of OFDM time domain signal is
fluctuated much larger than that for single carrier
signal
 Improvement of PAPR
Several methods have been proposed to reduce the PAPR of
OFDM signal
Signal Distortion Techniques
Clipping technique

Where x[n] is the OFDM signal, CL is the clipping level and, is the angle of x[n].
Clipping is a non-linear process that leads to both in-band and out-of-band
distortions. The out-of-band distortion causes spectral spreading and can be
eliminated by filtering the signal after clipping but the in-band distortion can
degrade the BER performance and cannot be reduced by filtering. However,
oversampling by taking longer IFFT can reduce the in-band distortion effect as
portion of the noise is reshaped outside of the signal band that can be removed
later by filtering.

Companding Transforms:
This method basically applied for audio signals. Companding consist
compression and expansion. After companding, the lower peak values are
increased but higher peaks remain constant and hence, average power of OFDM
signal is increased. Hence the peak to average power ratio decreases.
The main disadvantage of this method is to degrade BER performance
 Improvement of PAPR
Data coding technique
coding technique is to select those codeword that reduce the PAPR for
transmission. A forward error correction (FEC) code is defined by (n,k),
where n are the data bits and k represents redundant bits, so the idea is to
add redundant bit in a manner that overall PAPR value is minimized. FEC
are classified as block codes and run length codes.

Linear Block Coding

The main disadvantage of this method is to degrade

transmission efficiency
 Improvement of PAPR

Multiple Signalling and Probabilistic Techniques

Phase alignment technique

This method either generate multiple permutation of the OFDM
signal and transmit the one with minimum PAPR or to modify the
OFDM signal by introducing phase shifts, adding peak reduction
carrier or changing constellation points.

The Selected Mapping (SLM) and Partial Transmission Sequence

(PTS) methods which control the phase of data sub-carrier

The main disadvantage of this method is required to transmit

SIDE INFORMATION (SI) which leads the degradation of
transmission efficiency
Selective Mapping (SLM)
The basic idea in SLM technique is to generate a set of sufficiently different candidate
data blocks by the transmitter where all the data blocks represents the same
information as the original data block and select the favorable having the least PAPR for
transmission.

Let the input data block is X=[X0, X1, …….. XN-1 ], this data block is multiplied
with M different phase factors , where m= 0,1,2,………..M-1; and [0,2π] for
n=0,1,2….N-1. After taking IFFT, this multiplication generates M sequences in time
domain given by:

for m = 0,1…..M
Partial Transmit Sequence (PTS):
In PTS, an input data block of length N is partitioned into a number of disjoint sub-
blocks. Then each of these sub-blocks are padded with zeros and weighted by a phase
factor.

The data block X=[X0, X1, X2, …..XN-1] is divided in V disjoint sets,{Xv, v=1,2,…..v},using
same number of carriers for each group, the alternative frequency domain signal
sequence is given by:
CCDDF VS PPAPR
 Structure of Proposed PAPR Reduction Method
e j0 e j 2 j( N 1 )
Weighting Factors
e j1 e for Reducing PAPR

1st Preamble Symbol

2nd Preamble
Symbols

One Frame
Common
1st Data Symbol
weighting
factor over one
frame

Lth Data Symbol

0 1 2 N-1
Number of sub-carriers
Common weighting factor will be assigned for each sub-carrier over one
frame
 Determination of Weighting Factor by Using
Time-Frequency Domains Swapping Algorithm
Predetermined threshold level
(S) 3.5
3.5
Amplitude (Time Domain)

Amplitude (Time Domain)

jni
3
y (i )
3
E  e
(i )
n
2.5 l ,k  2.5

FFT
2

1.5
1.5

1
1

0.5
0.5

0
0 0 10 20 30 40 50 60
0 10 20 30 40 50 60
Time domain Frequency domain

 y (i ) if y(li,)k   S
  l ,k 
e(li,)k  
0 if y(li,)k   S

Basic concept of Time-Frequency Swapping Algorithm
Flowchart of Time-Frequency Domains Swapping Algorithm

y((li,)k ) 3
3.5

Calculation of 2
2.5

Time-domain Signal S 2

y((li,)k ) 1

mi (t)
1.5

Threshold 1

level(S) e(i )
l ,k 
 y (i )
  l ,k 

if y(li,)k   S 0.5

0 if y(li,)k   S 0
 0 20 40 60 80 100 120

Calculation of Error Signal 0 N-FFT N-1

2.5

2
(i)
E  l ,n 
2

1.5

FFT
1

ei (t)
1

 
0.5

j arg X (li,)n  E(li,)n

X (li,n1)  X (li,)n e 0

0 0 20 40 60
N-FFT
80 100 120
N-1

 
(li,n1)  arg X (li,n1)  arg X (li,)n   Determined Phase (weighting
Basic Concept of Proposed Algorithm

0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain  y (i ) if y(li,)k   S
  l ,k 
IFFT el ,k   
(i )

2 0 if y(li,)k   S

Amplitude

0
S Threshold
Level
-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Basic Concept of Proposed Algorithm
N 1 2 kn
1 j
El ,n 
(i)

N
 l ,k   e
e(i)

k 0
N

0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain

FFT
2
Amplitude

-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Basic Concept of Proposed Algorithm
X (li,n1)  X (li,)n e

j arg X (li,)n  E(li,)n 
0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain

FFT
2
Amplitude

-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Basic Concept of Proposed Algorithm

0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain

FFT
2
Amplitude

-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Basic Concept of Proposed Algorithm

0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain
IFFT
2
Amplitude

-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Basic Concept of Proposed Algorithm

0 N-1

0 1 2 3 4 5 6 N-2 N-1
Frequency Domain  y (i ) if y(li,)k   S
( i 1)  l ,k 
FFT el ,k   
2 0 if y(li,)k   S

Amplitude

0
S
-1
0 10 20 30 40 50 60
Sampling
Time time
Domain
Amplitude of OFDM signal in the time domain
3.5

3 3

2.5

2 2
Amplitude

1.5

1 1

0.5

0 0
0 20 40 60 80 100 120

0 20 40 60 80 100 120
Time Sample Number
(a) Before T-F Swapping Algorithm
1.6

1.5
1.4

1.2

1 1
Amplitude

0.8

0.6

0.5
0.4

0.2

0 0
0 20 40 60 80 100 120

0 20 40 60 80 100 120
Time Sample Number
(b) After T-F Swapping Algorithm
 Structure of Transmitter for Proposal
Method
0
Xn yk
i  Number of D/A

IFFT
S/P

P/S
Data& MOD +GI &
Preamble X predetermined iteration SSPA
or PAPR< Target U/C
N-1 No Yes
Calculate error
signal
Determination of
common weighting factor FFT

2 kn

 e
N 1
1 j n( i 1)
j
yk(i 1)  X n(i )  e N

N n 0
N 1 2 kn
1
 n e
j
( i 1)
 X N

N n 0
 PAPR Performance
Modulation Method
10 =64QAM
0

Conventional OFDM
Proposed method
CCDF (Prob. PAPR > Abscissa)

-1
10
Conventional

Proposed
-2
10

Number of sub-carriers = 64
-3
Frame length = 12 symbols
10
4 5 6 7 8 9 10 11 12
PAPR (dB)
 BER Performance
Modulation Method =16QAM
0
10
Linear
IBO = -2dB
-1 IBO = -4dB
10

10
-2 Conventional
BER

-3
10
Ideal
10
-4 Proposed
Multi path = 16 paths
Power Decay = -1dB
-5
Rayleight
10
10 15 20 25 30 35 40 45 50
C/N (dB)