Bandwidth-Efficient Bit-Interleaved Coded Modulation over NAF Relay Channels: Error Performance and Precoder Design
Bibliographic record
Abstract
This paper investigates the error performance and precoder design for a bandwidth-efficient bit-interleaved coded modulation (BICM) system over a non-orthogonal amplify-and-forward (NAF)half-duplex single-relay channel. A tight union bound on the bit error probability (BEP) is first derived for an arbitrary block length of 2N using a 2N × 2N precoder. This bound provides an useful tool to predict the error performance. Attention is then devoted to the system using 2×2 precoder, where a closed-form expression of the bound is obtained. Based on this expression, an optimal 2×2 precoder applicable to any modulation scheme is developed. Different from the optimal precoders designed for uncoded NAF systems, the derived precoder indicates that the source only needs to send the superposition of signals in the first time slot and being silent in the second time slot in order to achieve the best asymptotic performance. Analytical and simulation results show that the proposed precoder not only exploits full cooperative diversity but also offers a significant coding gain over optimal precoders for uncoded NAF systems.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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".