An experimental study on the robustness of integer-forcing linear receivers
Bibliographic record
Abstract
Recent work has proposed the integer-forcing (IF) linear receiver architecture as a promising alternative to the joint maximum likelihood (ML) receiver. It has been proven that the IF linear receiver can operate very close to the (optimal) performance of the joint ML receiver, but with essentially the same implementation complexity as a zero-forcing (ZF) linear receiver. In this paper, we take the first steps towards a complete software-defined radio (SDR) implementation of the IF linear receiver. Using the Wireless Open-Access Radio Platform (WARP) and IEEE 802.11 protocols, we develop an OFDM-based experimental framework to evaluate the performance of IF linear receivers in realistic indoor settings, and compare it to the performance of ZF and joint ML receivers. Our framework includes a channel estimation protocol and algorithm for selecting the best integer matrix for approximating the channel matrix. We have performed indoor experiments for a 2 × 2 MIMO network, which demonstrate that the symbol error rate (SER) of the IF linear receiver indeed outperforms the ZF linear receiver and can operate close to the joint ML receiver. We also argue, via simulations, that IF continues to outperform conventional linear receivers, even in the presence of significant channel estimation errors.
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.002 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".