Analysis of Adapted Tone Reservation PAPR Reduction Techniques in OTSM System
Bibliographic record
Abstract
Orthogonal time sequency multiplexing (OTSM) is one of the novel modulation candidates which has been recently proposed for future 6G wireless communications, as it outper-forms the well-known orthogonal frequency division multiplexing (OFDM) and orthogonal time frequency space (OTFS) systems in terms of bit error rate (BER) and computational complexity, respectively in a high-mobility doubly dispersive wireless channel. However, a current analysis reveals that OTSM suffers from a very high peak-to-average power ratio (PAPR) problem like the conventional OFDM. As a result, this paper takes the initiative of analyzing the efficacy of the adapted versions of the classical tone reservation (TR) PAPR reduction technique in the sequency-delay domain of the new OTSM systems, in terms of PAPR reduction gains, computational complexity and BER performance as currently, none exists in the literature. This research reveals how the TR can be adapted with reserved-tone vectors (RVs) to the new delay-sequency domains and how its PAPR reduction capability and computation complexity vary with each new algorithmic change. The results provide analytical and simulation-wise insights into the newly-adapted TR (A- TR) algorithms in OTSM systems which will prove to be useful for carrying out future research in 6G.
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.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".