2006
DOI: 10.1109/tbc.2005.856727
|View full text |Cite
|
Sign up to set email alerts
|

PAPR Reduction of an OFDM Signal by Use of PTS With Low Computational Complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
63
0
2

Year Published

2008
2008
2016
2016

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 140 publications
(65 citation statements)
references
References 13 publications
0
63
0
2
Order By: Relevance
“…CCDF [12,13] of the PAPR denotes the probability that the PAPR of a data block exceeds a given threshold. CCDF is the most frequently used performance metric for PAPR reduction methods.…”
Section: Resultsmentioning
confidence: 99%
“…CCDF [12,13] of the PAPR denotes the probability that the PAPR of a data block exceeds a given threshold. CCDF is the most frequently used performance metric for PAPR reduction methods.…”
Section: Resultsmentioning
confidence: 99%
“…After that, each subblock rotates by phase weighting vectors b v , and combines with other subblocks to generate a set of candidates. The candidate sequence which achieves the minimum PAPR value is selected for transmission [32]. Therefore, the time domain signal after combining the subblocks is given by…”
Section: Conventional Partial Transmit Sequence (C-pts)mentioning
confidence: 99%
“…However, the ESA requires an exhaustive search over all combinations of the allowed phase factors and has exponential search complexity with the number of subblocks. To reduce the computational complexity, some simplified search techniques have been proposed such as the Iterative Flipping Algorithm (IFA) [21]. Although the IFA significantly reduces the search complexity, there has been some gap between its PAPR reduction performance and that of the ESA.…”
Section: Partial Transmit Sequences (Pts)mentioning
confidence: 99%