A New Effective and Efficient Measure of PAPR in OFDM
Bibliographic record
Abstract
In multi-carrier wireless OFDM communication systems, a major issue is related to high peaks in transmitted signals, resulting in such problems as power inefficiency. In this regard, a common practice is to transmit the signal that has the lowest Peak to Average Power Ratio (PAPR). Consequently, some efficient and accurate method of estimating the PAPR of a signal is required. Previous literature in this area suggests a strong relationship between PAPR and Power Variance (PV). As such, PV has been advocated as a good measure of PAPR. However, contrary to what is suggested in the literature, our research shows that often low values of PV do not correspond to low values of PAPR. Hence, PV does not provide a sound scientific basis for comparing and estimating PAPR in OFDM signals. In this paper a novel, effective, and efficient measure of high peaks in OFDM signals is proposed, which is less complex than PAPR. The proposed measure, termed as Partial Power Variance (PPV), exploits the relationship among PAPR, Aperiodic Autocorrelation Co-efficient (AAC), and Power Variance (PV) of the transmitted signal. Our results demonstrate that, in comparison to PV, Partial Power Variance is a more efficient as well as a more effective measure of PAPR. In addition, we demonstrate that the computational complexity of PPV is far less than that of PAPR.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".