MIMO Sensing Beamforming Design with Low-Resolution Transceivers
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
Adopting low-resolution hardware at transceivers in multi-input multi-output (MIMO) sensing systems can substantially reduce hardware costs and power consumption. This motivates us to study MIMO sensing systems with hardware constraints, specifically phase-only analog transmit antennas and low-resolution receive antennas. This paper adopts a Bayesian approach and aims to design low-complexity algorithms for the MIMO sensing beamforming problem while leveraging prior information about the target at each sensing stage. We formulate the problem of minimizing the Bayesian Cramér-Rao lower bound (BCRLB) for estimating a parameter of interest, and show that it has the structure of a weighted sum-of-ratios problem. For the case where the phase shifters at transmit antennas are continuous, we propose a novel linear transform that can transform a fractional function into a linear function. In this way, the original problem is turned into a sequence of sub-problems that can be solved in closed-form in each step with linear complexity in the number of antennas, making the iterative optimization process highly efficient. When the phase shifters are discrete, we propose a penalty-based convex-hull relaxation algorithm, which provides better performance than directly quantizing the solution of the continuous case, but at the cost of increased computational complexity. Numerical results demonstrate the effectiveness of the proposed algorithms.
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.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.000 |
| 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 it