Precoding Design for Two-Way MIMO Full-Duplex Amplify-and-Forward Relay Communication Systems
Bibliographic record
Abstract
Full duplex (FD) multiple-input multiple-output (MIMO) relaying can significantly increase the spectral efficiency of cooperative communication systems. This paper examines the problem of linear source and relay precoder and destination combiner design for two-way MIMO FD amplify-and-forward (AF) relay communication systems. The effect of the residual loop interference (LI) due to imperfect LI cancellation is considered in the design. Two algorithms are proposed to minimize the mean squared error (MSE) of the received signals at the destinations. The first is a tri-step alternating iterative algorithm and the second is a bi-step iterative algorithm. The convergence and complexity of these algorithms are analyzed. Simulation results are presented, which show that the proposed two-way FD system provides approximately double the achievable rate of the corresponding half-duplex (HD) system when the residual LI is low. Furthermore, the bi-step algorithm shows comparable performance to the tri-step algorithm and has a lower computational complexity.
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.001 |
| 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".