Paper Info
Title
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.
Year
DOI
Venue
2017
10.1007/s10586-017-1124-9
Cluster Computing
Keywords
Field
DocType
Peak-to-average power ratio (PAPR), Partial transmit sequence (PTS), Universal filtered multi-carrier (UFMC), 5G
Mathematical optimization,Computer science,Algorithm,Real-time computing,Universal filtered,Orthogonal frequency-division multiplexing,Computational complexity theory
Journal
Volume
Issue
ISSN
20
4
1386-7857
Citations 
PageRank 
References 
3
0.42
18
Authors
3
Name
Order
Citations
PageRank
Rong Wang140.78
Jingye Cai2132.39
Xiang Yu35012.78