A Low Complexity PTS Phase Coefficient Searching Algorithm for OFDM System

Abstract

The Partial Transmit Sequence (PTS) is a very promising algorithm for reducing peak-to-average ratio (PAPR) in OFDM system. However, the high average computational time complexity of rotation phase coefficient searching in PTS algorithm makes it difficult to implement. For reducing the average computational time complexity of PTS algorithm with negligible performance penalty, we proposed a dynamic discrete particle swarm optimization based phase coefficient searching (DDPSO-PCS) algorithm for PTS. DDPSO-PCS algorithm seeks the optimum phase coefficients in PTS with Particle Swarm Optimization algorithm. The number of particles will be adjusted during iterations to reduce the average computational time complexity. The DDPSO-PCS algorithm can reduce 50% to 90% average computational time complexity comparing with traditional PTS phase coefficient searching algorithm. In addition, the simulations show that the performance degradation of DDPSO-PCS based PTS is in the range of (0, 0.4dB).