Perfect Self-Interference Cancellation Based on Mode-Switching for Differential Channel-Unaware Two-Way Relay Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We consider channel-unaware two-way relay networks in which two single-antenna nodes exchange information through multiple single-antenna half-duplex amplify-and-forward relays. For these networks, we develop a novel self-interference (SI) cancellation scheme that does not invoke channel information neither at the relays nor at the nodes. Unlike its previous counterparts, the scheme proposed herein enables perfect SI cancellation even when the relays have a single antenna each. This was not possible previously without employing an even number of antennas at each relay. In the first phase of the proposed scheme, the network is operated in a one-way relaying mode, whereas in the second phase it is operated in a two-way relaying mode. In the latter mode, the vectors received by the nodes at the end of the first phase are used to completely eliminate SI, without estimating the channel as in existing methodologies. To analyze the effectiveness of the proposed scheme, we derive upper bounds on the pairwise error probability for the Alamouti and SP(2) codes. Using these bounds, we investigate the dependence of the system performance on the data rate. In addition, we show that for all data rates, the proposed scheme outperforms previously proposed ones. Theoretical results are confirmed by 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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 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 it