Novel Schemes Based on Greedy Algorithm for PAPR Reduction in OFDM Systems

In this paper, novel schemes based on greedy algorithm are proposed to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. For each proposed scheme, a simple transformation is performed on the partial transmit sequences in an iterative fashion to lower the PAPR. Computer simulations results show that all the proposed schemes can achieve PAPR reductions, but the performances of the PAPR reduction are different. To further evaluate their PAPR reductions, we compare the proposed schemes with the iterative flipping scheme. The results show that when the number of sub blocks is not large, some of the proposed schemes can offer better PAPR reduction performance than the iterative flipping scheme with comparable computational complexity. We propose an enhanced version of iterative flipping algorithm to efficiently reduce the PAPR of the OFDM signal. An adjustable parameter is chose based on the performance. Simulation results show that this new technique gives good performance with significantly lower complexity compared with the ordinary PTS scheme.