Two-way relaying using constant envelope modulation and phase-superposition-phase-forward
Bibliographic record
Abstract
In this article, we propose the idea of phase-superposition-phase-forward (PSPF) relaying for 2-way 3-phase cooperative network involving constant envelope modulation with discriminator detection in a time-selective Rayleigh fading environment. A semi-analytical expression for the bit-error-rate (BER) of this system is derived and the results are verified by simulation. It was found that, compared to one-way relaying, 2-way relaying with PSPF suffers only a moderate loss in energy efficiency (of 1.5 dB). On the other hand, PSPF improves the transmission efficiency by 33%. Furthermore, we believe that the loss in transmission efficiency can be reduced if power is allocated to the different nodes in this cooperative network in an 'optimal' fashion. To further put the performance of the proposed PSPF scheme into perspective, we compare it against a phase-combining phase-forward technique that is based on decode-and-forward (DF) and multi-level CPFSK re-modulation at the relay. It was found that DF has a higher BER than PSPF and requires additional processing at the relay. It can thus be concluded that the proposed PSPF technique is indeed the preferred way to maintain constant envelope signaling throughout the signaling chain in a 2-way 3 phase relaying system.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".