A Comparative Analysis of OFDM with PTS and Low Complexity PTS

Partial transmit sequence (PTS) is one of the most well-known peak-to-average power ratio (PAPR) reduction techniques proposed for orthogonal frequency-division multiplexing (OFDM) systems. The main drawbacks of the conventional PTS (C-PTS) are high computational complexity and transmission of several side information bits. A new PTS with simple detector is proposed in this paper to deal with these drawbacks of C-PTS. The candidates can be generated through cyclically shifting each subblock sequence in time domain and combining them in a recursive manner. At the receiver, by utilizing the natural diversity of phase constellation for different candidates, the detector can successfully recover the original signal without side information. Numerical simulation shows that the proposed scheme performs very well in terms of PAPR. The probability of detection failure of the side information demonstrates that the detector could work without any side information with high reliability. The proposed scheme achieves almost the same bit error rate (BER) performance as the C-PTS with perfect side information, under both additive white Gaussian noise (AWGN) channel and Rayleigh fading channel.