A low complexity PTS technique for PAPR reduction in OFDM systems

One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak-to-average ratio (PAPR) of the transmitted signal. The PTS method divides the input data block into disjoint subblocks and recombines them by using weighting factors. The searching complexity of the original PTS method increases exponentially with the number of these subblocks and is extremely high for a larger number of subblocks. In this paper we present a modified type of PTS algorithm combining with the minimal trellis of linear block codes, which not only reduces the searching complexity but also provides extra error-correction property.