Abstract
In the tone reservation (TR) scheme, it is known that finding the optimal peak reduction tone (PRT) set is equivalent to solving the secondary peak minimization problem. However, this problem cannot be solved for the practical number of tones because it is nondeterministic polynomial-time (NP)-hard. In this paper, two efficient methods for selecting a near optimal PRT set are proposed. The first method is a random search algorithm with reduced computational complexity based on the observation that the secondary peak value of the time domain kernel, which is obtained by inverse fast Fourier transforming the characteristic sequence of the PRT set, statistically tends to decrease as the variance of the time domain kernel decreases. The second method is a deterministic selection algorithm using the cyclic difference set. The near optimality of these methods is confirmed through the numerical analysis.
| Original language | English |
|---|---|
| Article number | 4539813 |
| Pages (from-to) | 454-460 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Broadcasting |
| Volume | 54 |
| Issue number | 3 |
| DOIs | |
| State | Published - Sep 2008 |
Keywords
- Cyclic difference sets
- Orthogonal frequency division multiplexing (OFDM)
- Peak reduction tone (PRT)
- Peak to average power ratio (PAPR)
- Tone reservation (TR)