Compressive Sensing-Based Channel Estimation for Uplink and Downlink Reconfigurable Intelligent Surface-Aided Millimeter Wave Massive MIMO Systems
Bibliographic record
Abstract
This paper investigates single-user uplink and two-user downlink channel estimation in reconfigurable intelligent surface (RIS)-aided millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) wireless communication systems. Because of the difficulty associated with the estimation of channels in RIS-aided wireless communication systems, channel state information (CSI) is assumed to be known at the receiver in some previous works in the literature. By assuming that prior knowledge of the line-of-sight (LoS) channel between the RIS and the base station (BS) is known, two compressive sensing-based channel estimation schemes that are based on simultaneous orthogonal matching pursuit and structured matching pursuit (StrMP) algorithms are proposed for estimation of uplink channel between RIS and user equipment (UE), and joint estimations of downlink channels between BS and a UE, and between RIS and another UE, respectively. The proposed channel estimation schemes exploit the inherent common sparsity shared by the angular domain mmWave channels at different subcarriers. The superiority of one of the proposed channel estimation techniques, the StrMP-based channel estimation technique, with negligibly higher computational complexity cost compared with other channel estimators, is documented through extensive computer simulation. Specifically, with a reduced pilot overhead, the proposed StrMP-based channel estimation scheme exhibits better performance than other channel estimation schemes considered in this paper for signal-to-noise ratio (SNR) between 0 dB and 5 dB upward at different instances for both uplink and downlink scenarios, respectively. However, below these values of SNR the proposed StrMP-based channel estimation scheme will require higher pilot overhead to perform optimally.
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.000 | 0.001 |
| 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 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".