Low-complexity PTS PAPR reduction scheme for UFMC systems

Abstract

In this study, a low-computational-complexity partial transmit sequence (PTS) is proposed for reducing peak-to-average power ratios (PAPRs) of universal filtered multi-carriers (UFMCs). First, we analyze the differences in PAPR between a UFMC system and an orthogonal frequency division multiplexing system. Second, we characterize the threshold of the minimum peak power of the UFMC symbol and delete the candidate signal samples with power values below the threshold. This allows for a reduction in the number of time-domain samples that are multiplied by the corresponding phase-rotating vectors; in addition, it can be used for estimating the PAPR. Third, considering the relationship between the phase-weighting sequences, the computational complexity of the candidate signals is simplified. Numerical results show that the proposed PTS scheme achieves nearly the same PAPR reduction as that achieved by the conventional PTS scheme; meanwhile, it has considerably low computational complexity when the probability, $$\beta $$ , of the maximum peak power being more than the possible minimum peak power is greater than or equal to 0.5.