Channel Estimation for Reconfigurable Intelligent Surface Aided Multi-User mmWave MIMO Systems
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
Channel acquisition is one of the main challenges for the deployment of reconfigurable intelligent surface (RIS) aided communication systems. This is because an RIS has a large number of reflective elements, which are passive devices with no active transmitting/receiving abilities. In this paper, we study the channel estimation problem for the RIS aided multi-user millimeter-wave (mmWave) multi-input multi-output (MIMO) system. Specifically, we propose a novel channel estimation protocol for the above system to estimate the cascaded channels, which are the products of the channels from the base station (BS) to the RIS and from the RIS to the users. Further, since the cascaded channels are typically sparse, this allows us to formulate the channel estimation problem as a sparse recovery problem using compressive sensing (CS) techniques, thereby allowing the channels to be estimated with less training overhead. Moreover, the sparse channel matrices of the cascaded channels of all users have a common block sparsity structure due to the common channel between the BS and the RIS. To take advantage of the common sparsity pattern, we propose a two-step multi-user joint channel estimation procedure. In the first step, we make use of the common column-block sparsity and project the received signals onto the common column subspace. In the second step, we make use of the row-block sparsity of the projected signals and propose a multi-user joint sparse matrix recovery algorithm that takes into account the common channel between the BS and the RIS.
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.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