A Low-Complexity PTS Based on Greedy and Genetic Algorithm for OFDM Systems

Partial transmit sequence (PTS) is one of effective technique to reduce high Peak-to-average power ratio (PAPR) in Orthogonal frequency division multiplex- ing (OFDM) system. However, the complexity of Original PTS (O-PTS) increases exponentially with the number of sub-blocks. To reduce the computational complexity while still offering a lower PAPR, a new PTS method is pro- posed to search for suboptimal rotating vectors in this pa- per. In the proposed method, the candidate rotation vec- tors are generated based on greedy and genetic algorithm. We also combine the proposed method and the superim- posed training sequence method to get a further PAPR reduction. The theory and simulations results show that the proposed method can achieve better PAPR reduction and significantly reduce the computational complexity.