Академический Документы
Профессиональный Документы
Культура Документы
By
E. Geetha Rani
14B81D6501
Guided by
Shakeel Ahmed
Senior Asst. Prof
Introduction to OFDM
Definition of OFDM
Example of OFDM
Lets we have following information bits
1, 1, -1, -1, 1, 1, 1, -1, 1, -1, -1, -1, -1, 1, -1, -1,
Just converts the serials bits to parallel bits
C1
C2
C3
C4
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
V (t ) I n (t ) sin( 2nt )
n 0
V(t)
Inter-Symbol-Interference
Transmitted signal:
Received Signals:
Line-of-sight:
Reflected:
Delays
Ch.2
Ch.3
Ch.4
Ch.5
Ch.6
Ch.7
Ch.8
Ch.9
Ch.10
frequency
frequency
Disadvantages of OFDM
Peak to average power ratio (PAPR)
x(t )
PAPR
P
avg
PAPR
max x t
0 t T
T
1/ T x t dt
0
Bandwidth Regrowth
For better approximating the true PAPR in the discretetime case, we usually oversample x(t) by a factor of L ,
i.e., the sampling rate is L/Ts .
X X 0 , X 1 , L , X N / 2 1 , 0,
L
,
0,
X
N
/
2
,
L
,
X
N
14 2 43
1
N
E xk
The CCDF of the PAPR denotes the probability that the PAPR of
a data block exceeds a given threshold.
From the central limit theorem, the real and imaginary parts of
the time domain signal samples follow Gaussian distributions,
assuming each distribution with a mean of zero and a variance of
0.5 for a multicarrier signal with a large number of subcarriers.
The CCDF of the PAPR of a data block with Nyquist rate sampling is
derived as
F z 1 exp z .
P PAPR z 1 P PAPR z
1 F z
1 1 exp z .
N
This expression assumes that the N time domain signal samples are mutually
independent and uncorrelated.
Distortion
o Clipping
o Peak Windowing and Peak Cancellation
o Companding
Others
o
Clipping
By distorting the OFDM signal amplitude, a kind
of self-interference introduced that degrades the
BER.
Nonlinear
radiation.
distortion
increases
out-of-band
Companding
Companding
Peak Windowing
Symbol (QPSK) of sub-carrier i at time k
Other symbol-alphabets can be used as well
(BPSK, m-QAM)
Baseband signal is generated by DSP
s BB ,i ,k (t ) w(t kT ) xi ,k exp j 2 if (t kT )
Window function
Sub-carrier
xi,k
Im
Re
jn( u )
, n(u ) [0, 2 ), 0 n N , 1 u U
must be defined.
2.
3.
IDFT
{
A
}
%
a
a
time domain to get
and finally that
transmit sequence with the lowest PAPR is chosen.
N = 256, L = 4, 16-QAM,
Pn( u ) {1, 1, j, j}.
e
| n 0,1,K ,
b(1) without
1
any loss of performance.
M 1
W
Hence,
sets of phase factors are searched to find the optimum
set of phase factors.
PTS needs M IDFT operations for each dataM 1block, and the number
log 2 W
of required side information bits is
.
M 1
Example of OFDM
Lets we have following information bits
1, 1, -1, -1, 1, 1, 1, -1, 1, -1, -1, -1, -1, 1, -1, -1,
Just converts the serials bits to parallel bits
C1
C2
C3
C4
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
Ranking of PAPR
Results
For a spectrum of 1000 sets of randomly generated data in
time domain when the number of sub carriers is 16. The
maximum PAPR of 1000 random data is 9.5 dB
Theoretical Peak value of the data without PAPR reduction
method is 12 dB
The Peak Value decreases to 8 dB by pre-scrambling method
The Pre- Scrambling method has 0.5 dB performance gain
over conventional PTS and considering the data which has
high PAPR value (Worst Case)
PTS requires several IFFT operations which lead to problem
of real time transmission because of transmission delay. But
this problem is solved in Pre- Scrambling Method