Simplified Approach to Optimized Iterative Clipping and Filtering for PAPR Reduction of OFDM Signals

Iterative clipping and filtering (ICF) is a well-known technique to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals. Recently, Wang and Luo investigated the clipped signal and proposed a modified algorithm called optimized ICF (OICF). This is an optimal algorithm since it can achieve the required PAPR reduction with minimum in-band distortion and far fewer iterations. However, OICF needs to solve a convex optimization problem with O(N3) complexity, where N represents the number of subcarriers. In this paper, instead of analyzing the clipped signal, we study the clipping noise and propose a simplified OICF algorithm. In the new algorithm, solving the convex optimization problem is approximated by some simple algebraic operations and the computational complexity reduces to O(N). Simulation results show that after three iterations, the original OICF algorithm can achieve the desired PAPR while the simplified one exhibits almost the same performance: for a 128-subcarrier and quadrature phase shift keying (QPSK) modulated OFDM system, the PAPR-reduction performance difference between the two algorithms are 5×10-3dB at a 10-4 clipping probability and the bit-error-rate performance difference is 6×10-3 dB at a 10-7 error probability.