Achievable Rate Analysis and Max-Min SINR Optimization in Intelligent Reflecting Surface Assisted Cell-Free MIMO Uplink
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
In this paper, we study the uplink transmission in an intelligent reflecting surface (IRS) assisted cell-free multiple-input multiple-output (MIMO) system where the central processing unit (CPU) only has statistical channel state information (CSI) to detect symbols, and to design the receiver filter coefficients, the power allocations, and the IRS phase shifts. The access points (APs) estimate only their local end-to-end channels with the users using minimum mean squared error (MMSE) estimation to implement matched filtering, thereby avoiding the large overhead associated with estimating individual IRS-assisted channels. Under this framework, we derive a closed-form expression for the achievable uplink net rate that only depends on the channel statistics. Using this expression, we formulate the problem of maximizing the minimum (max-min) signal-to-interference plus noise ratio (SINR) to design the receiver filter coefficients at the CPU, the power allocations at the users, and the phase shifts at the IRS, subject to per user power constraints as well as IRS phase shift resolution constraints. The resulting problem is jointly non-convex in the three design variables and is solved using an alternating optimization algorithm. In particular, the receiver filter design is formulated as a generalized eigenvalue problem leading to a closed-form solution, the power allocation problem is solved using a geometric programming (GP) approach, and the IRS phase shifts are designed using an alternating maximization algorithm. For comparison, we also formulate and solve the max-min SINR problem for the scenario where the instantaneous imperfect CSI of all individual direct and IRS-assisted channels is available at the CPU. Numerical results show that the scheme designed using statistical CSI has the potential to outperform the scheme based on instantaneous CSI for moderate to large number of IRS elements, due to savings in the channel estimation overhead.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.005 | 0.003 |
| 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