Journal of Northeastern University ›› 2009, Vol. 30 ›› Issue (4): 522-525.DOI: -

• OriginalPaper • Previous Articles     Next Articles

A novel PTS PAPR reduction algorithm with low computational complexity in OFDM system

Gao, Jing (1); Wang, Jin-Kuan (1); Xie, Zhi-Bin (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-04-15 Published:2013-06-22
  • Contact: Gao, J.
  • About author:-
  • Supported by:
    -

Abstract: PAPR (peak-to-average power ratio) is the basic barrier to the practical application of OFDM system. To solve this problem, a novel PTS (partial transmit sequence) algorithm based on improved simulated annealing PTS (IMSA-PTS) is proposed, where the improved SA optimization approach is used to search the optimal combination of phase factors so as to avoid the local minimum due to the search for phase factor and acquire the minimum PAPR signal from all the states occurring in exhaustive search with unchanged simulated annealing process. Simultaneously, a threshold value is set to improve the convergence rate so as to reduce the computational complexity significantly. Simulation results showed that the proposed algorithm can provide favorable PAPR reduction with low computational complexity.

CLC Number: