Open AccessReducing Complexity in PTS Scheme using Optimization Techniques to reduce PAPR in OFDM Systems
Author(s) -
R. Sarankumar,
K. Sumathi,
G. Sai Sravanthi,
Bondu Venkateswarlu,
P. Rajasekar
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1074/1/012032
Subject(s) - orthogonal frequency division multiplexing , particle swarm optimization , reduction (mathematics) , bit error rate , computer science , simulated annealing , optimization problem , amplifier , computational complexity theory , algorithm , electronic engineering , mathematical optimization , mathematics , channel (broadcasting) , bandwidth (computing) , telecommunications , engineering , decoding methods , geometry
OFDM is a technique used to combat Inter Symbol Interference (ISI) in wireless communication systems. OFDM offers high reliable data rate over frequency selective channels. But the drawback is high Peak to Average Power Ratio (PAPR) which will affect the power amplifier in the RF front end. Partial Transmit Sequence (PTS) has proven to be the efficient technique to minimize the PAPR in OFDM systems and it does not affect the Bit Error Rate (BER) much. But PTS in turn suffers from high search complexity. The optimization algorithms can offer a tradeoff between the search complexity and PAPR reduction. In this work the phase factor optimization in PTS scheme is converted into a one dimensional optimization problem. Genetic Algorithm (GA), Simulated Annealing (SA) and Particle Swarm Optimization (PSO) are applied to the problem defined. They are also compared in terms of PAPR reduction and complexity. The fitness functions are chosen according to the optimization technique.