Novel schemes based on greedy algorithm for papr reduction in OFDM systems

  • Authors:

  • Xiaodong Zhu;Tao Jiang;Guangxi Zhu

  • Affiliations:

  • Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan;-;-

  • Venue:
  • IEEE Transactions on Consumer Electronics
  • Year:
  • 2008

Quantified Score

Hi-index 0.43

Visualization

Abstract

In this paper, five 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 subblocks is not large, some of the proposed schemes can offer better PAPR reduction performance than the iterative flipping scheme with comparable computational complexity.