Incremental Grassmannian Feedback Schemes for Multi-User MIMO Systems
Bibliographic record
Abstract
The communication of side information forms a key component of several effective strategies for transmitter adaptation to slowly fading channels. When the relevant side information is a subspace, the feedback scheme can be viewed as a lossy source compression scheme on the Grassmannian manifold. Memoryless vector quantization on each fading block is a viable compression scheme, but it neglects any temporal correlation between the blocks. In this paper, we propose an incremental approach to Grassmannian quantization that takes advantage of temporal correlation. The approach leverages existing codebooks for memoryless quantization schemes and employs a quantized form of geodesic interpolation. Two schemes that implement the principles of the proposed approach are presented. In the first scheme, the choice of the step size in the incremental update is adapted to a first-order GaussMarkov model for the channel, which enables the use of higher resolution codebooks. In the second scheme, a single bit is allocated to the step size, which enables adaptation of the step size to the channel realization rather than the channel statistics. This provides substantial robustness against mismatches in the model for the temporal correlation. A distinguishing feature of the proposed approach is that the direction of the geodesic interpolation is specified implicitly using a point in a conventional codebook. As a result, the approach has an inherent ability to recover autonomously from errors in the feedback path. Simulation results demonstrate that these features result in improved performance over some existing schemes in a variety of channel environments.
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.000 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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 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".