Optimal Training Design for MIMO-OFDM Two-Way Relay Networks
Bibliographic record
Abstract
In this paper, we study a training design problem for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) amplify-and-forward (AF) two-way relay networks. Unlike the existing studies, we assume the spatially correlated fading and consider the nonreciprocal channel condition, which is a more practical assumption but makes the training problem more challenging. The equivalent channels of bidirectional relaying links, which consist of self-interfering channels and information-bearing channels, are estimated at each source node based on a linear minimum mean square error (LMMSE) approach. The total mean square error (MSE) of the channel estimation is minimized under the transmit power constraints at the source nodes and at the relay. To solve this problem, we first derive an optimal structure of the training signals, and then, convert the optimization problem into a tractable convex form, from which the optimal training scheme is designed efficiently. Furthermore, for a practical special case, the optimal training design is derived in semi-closed form, which provides useful insights. To reduce the required complexity, a low-complexity training scheme is also derived in closed-form. This scheme is shown to be asymptotically optimal in the high signal-to-noise ratio (SNR) regime and gives further insights into the optimal training. The performance of the proposed schemes is demonstrated through numerical simulations.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.006 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.006 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 teacher head, 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".