Multipair Massive MIMO Relaying with Pilot-Data Transmission Overlay
Bibliographic record
Abstract
We propose a pilot-data transmission overlay scheme for multipair massive multiple-input multiple-output (MIMO) relaying systems employing either half- or full-duplex (HD or FD) communications at the relay station (RS). In the proposed scheme, pilots are transmitted in partial overlap with data to decrease the channel estimation overhead. The RS can detect the source data with minimal destination pilot interference by exploiting the asymptotic orthogonality of massive MIMO channels. Then pilot-data interference can be effectively suppressed with assistance of the detected source data in the destination channel estimation. Due to the transmission overlay, the effective data period is extended, hence improving system throughput. Both theoretical and simulation results confirm that the proposed pilot-data overlay scheme outperforms the conventional separate pilot-data design in the limited coherence time interval scenario. Moreover, asymptotic analyses at high and low SNR regions demonstrate the superiority of the proposed scheme regardless of the coherence interval length. Because of simultaneous transmission, the proper allocation of source data transmission and relay data forwarding power can further improve the system performance. Hence a power allocation problem is formulated and a successive convex approximation approach is proposed to solve the non-convex optimization problem with the FD pilot-data transmission overlay.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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 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".