PAPR Reduction in OFDM via Active Constellation Extension–Projection Onto Convex Sets Combined with Particle Swarm Optimization

Active constellation extension–projection onto convex sets (ACE–POCS) algorithm is an interesting method for reducing the envelope fluctuations in orthogonal frequency division multiplexing signals. It has nice theoretical and optimality properties, but converges slowly. In this paper, Particle swarm optimization is introduced to fight this slowness, by searching and reducing the peak-to-average power ratio (PAPR) with respect to ACE–POCS. Simulation results show that the proposed method solves the PAPR problem with a high speed of convergence and a good binary error rate performance.