Analysis of Clipping Noise and Tone-Reservation Algorithms for Peak Reduction in OFDM Systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Orthogonal frequency division multiplexing (OFDM) suffers from a high peak-to-average power ratio (PAR). Tone reservation is a popular PAR reduction technique that uses a set of reserved tones to design a peak-canceling signal. In a previous paper by Krongold and Jones, an active-set approach was developed to efficiently compute the peak-canceling signal. In this paper, we consider the use of clipping noise, which is generated when the OFDM signal is clipped at a predefined threshold, to design the peak-canceling signal. To this end, the clipping noise is analyzed as a series of parabolic pulses under tone-reservation constraints. The single-pulse case and the multiple-pulse case are treated. The analysis explains peak regrowth and the constancy of the clipping noise power spectrum over the whole OFDM band. Moreover, the clipping noise at the end of several clipping and filtering iterations is shown to be approximately proportional to that generated in the first iteration. The constant of proportionality is estimated via the level-crossing theory for high clipping thresholds. Using this analysis, a constant-scaling algorithm and an adaptive-scaling algorithm are proposed for tone reservation. These algorithms scale the filtered first-iteration clipping noise to compensate for peaks that are above the threshold. The simulation results show that the proposed algorithms achieve a larger peak reduction and lower complexity than the active-set algorithm.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it