Professional Documents
Culture Documents
com/publication/10004924
(1)
N 1
j 2 n ft
,0 t T
X (n ) e
N n 0
PAPR 10 log 10
554
max
x (t )
0 t NT
Pav
scholar.waset.org/1999.5/10004924
(2)
International Science Index, Electronics and Communication Engineering Vol:10, No:4, 2016 the-research.com/publication/10004924
x ( n)
1 N 1
j 2 k n / N
,0 n N 1
X (k ) e
N k 0
(3)
T
X [ X 0 , X1,..., X N 1 ]
and the phase rotation vector is denoted as
u
T
B [bu ,0 , bu ,1 ,..., bu ,N 1 ] ,1 u U
where
T
X ( k ) [ X ( 0), X (1),..., X ( N 1)]
PAPR 10 log 10
max
x(n)
0 n N 1
(4)
Pav
PAPRo N
)
X u =X . B u
X
IFFT
Input data
S/P
IFFT
Select
signal
With
lowest
PAPR
IFFT
T
[ X 0bu,0 , X 1bu,1 ,.., X LN 1bu,LN 1 ] , u 1,2,..., U (9)
u
u
x IFFT ( X )
u
x
LN1
j 2nft
, 0 n LN 1, u 1,2,...,U
X n . bu,n .e
LN n0
1
(11)
B. Clipping Algorithm
Let x ( n ) , n 0,1,..., LN 1 denote the output of LN-point
IFFT. Clipping method limits the peak amplitude of complex
OFDM symbol x(n) whenever it exceeds a certain threshold
value (A), otherwise it allows the input signal for transmission
as,
x(n)
(10)
x(n ) ,
(8)
A. C-SLM [2]
(7)
(5)
(6)
A.e
j ( n )
x(n ) A
,
x(n) A
(12)
555
scholar.waset.org/1999.5/10004924
International Science Index, Electronics and Communication Engineering Vol:10, No:4, 2016 the-research.com/publication/10004924
candidate x2 as
u
x( n ) [ x1 : x2 ]
(15)
B
B. Algorithm 2 (Algorithm w
with Interleavinng Segmentation)
Stepp 1: The inputt data block X is partitionned into two subblocks, naamely Xodd, Xeeven respectivelly. Xodd consissts of
odd indexxed input sym
mbols and Xevenn consists of even
indexed innput symbols ddenoted as
T
X odd [ X (1), X (3),..., X ( N 1)]
(16)
T
X eeven [ X (0), X ( 2),..., X ( N )]
(17)
Stepp 2: LN/2 poinnt IFFT is takken for the inpput vector X odd ,
then clippping algorithm
m is applied. T
The resultant time
_
(18)
V. ANALY
YSIS OF COMPU
UTATIONAL CO
OMPLEXITY
(13)
(14)
Nadd LN
N log 2 LN
(19)
(20)
556
scholar.waset.org/1999.5/10004924
International Science Index, Electronics and Communication Engineering Vol:10, No:4, 2016 the-research.com/publication/10004924
(21)
(22)
Complexityof Proposedalggorithm
Compleexityof C - SLM
M
CCRR 1
100% (23)
TA
ABLE I
COMPUTATIONALL COMPLEXITY OFF PROPOSED ALGO
ORITHMS WITH C--SLM
WHEEN N=256
S. No
C-SLM
P
Proposed
Algorithhm
CCRR%
%
When U=4
Nmul
20,480
11,520
43.75
Nadd
40,960
23,040
43.75
When U=16
Nmul
81,920
39,168
52.18
163,840
78,336
Nadd
52.18
When U=64
327,680
149,760
Nmul
54.29
655,360
299,520
Nadd
54.29
The CCRR oof the proposedd algorithm ovver C-SLM iss given
in Table I. Herre, we assumed that N=2556 and U=4, 16, 64
respectively. W
When U=16, the CCRR of the prooposed
LM.
alggorithms is 522% when comppared to C-SL
VI. SIMULATION REESULTS AND DISCUSSION
The performaance of the prooposed algoritthms is evaluaated in
terrms of CCDF of PAPR, BE
ER and compuutational compplexity.
Foor the purposee of simulationn, 10000 randoomly generateed data
syymbols are modulated using Quaddrature Ampplitude
M
Modulation (QA
AM) and thee number of ssub-carriers N
N=256,
ovversampling faactor L=4 andd the number of candidates U=16
arre examined. T
The PAPR redduction perforrmance of prooposed
alggorithms 1 and 2 is analyzed through sim
mulations.
Fig. 3 show
ws the CCDF
F comparisonn of the prooposed
alggorithms 1 aand 2 with reespect to OFDM, clippingg with
cliipping ratio C
CR=1.4 & 1.6, C-SLM withh U=16 and a hhybrid
sccheme with thee serial combiination of SLM
M and clipping. The
sim
mulation result shows that the proposed algorithms 1 and 2
prrovide same P
PAPR reducttion performaance. The PA
APR at
CC
CDF = 10-2 iss improved byy 0.25 dB, 0.445 dB than C
C-SLM
and is
foor the clippingg ratio (CR) 1.4 and 1.6 respectively,
r
pooorer than appplying clippingg alone and hyybrid scheme with a
seerial combinatiion of SLM annd clipping.
F
Fig. 4 shows thhe BER perforrmance compaarison of propposed
algoorithms with cconventional aalgorithms over Additive White
W
Gauussian Noise (AWGN)
(
channnel. The BE
ER performancce of
the proposed algorithm slighhtly degradess with respecct to
DM, SLM andd serial combiination of SLM
M & clippingg, but
OFD
bettter than clippping as the cllipping noise of the combbined
scheeme would bee less than the clipping technnique is applieed to
the whole data.
557
scholar.waset.org/1999.5/10004924
International Science Index, Electronics and Communication Engineering Vol:10, No:4, 2016 the-research.com/publication/10004924
VII. CONCLUSION
In this paper, we proposed a low complexity hybrid scheme
based on clipping and SLM algorithms for PAPR reduction in
OFDM systems. To reduce the computational complexity,
both algorithms are applied simultaneously. Simulation results
show that our algorithm achieves improved PAPR reduction
performance than C-SLM using less number of IFFT blocks
with slight degradation in BER performance. From the
computational complexity analysis, the proposed hybrid
scheme achieves almost 52% complexity reduction when
compared to other hybrid schemes and C-SLM algorithm.
Hence, the proposed hybrid scheme is promising to reduce
PAPR of OFDM signal with much reduced complexity at the
cost of slight degradation in BER performance.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
558
scholar.waset.org/1999.5/10004924