Improved particle swarm optimization for PAPR reduction of OFDM systems

PTS is highly efficient in peak-to-average power ratio (PAPR) reduction of OFDM systems, but the considerable computational complexity for the required search through a high-dimensional vector space is potential problem for a practical implementation. In this paper, we formulate the search problem of PTS as a combinatorial optimization (CO) problem, then propose an algorithm based on improved discrete particle swarm optimization (I-DPSO), which reduces the number of multiplications required for PTS. Numerical results show that, the proposed algorithm can achieve performance-complexity tradeoff for moderate PAPR reduction.