Compressive Sensing Based Nuclear Norm Minimization Method for Massive MU-MIMO Channel Estimation
Bibliographic record
Abstract
We address the problem of uplink channel estimation in TDD massive multiuser multi-input-multi-output (MU-MIMO) systems, when the uplink training duration is limited. Based on the concept of compressive sensing (CS), the uplink channel could be estimated with limited training duration if the channel can be sparsely represented. In this paper, a low-rank matrix approximation (LRMA) based on CS technique is proposed for the massive MU-MIMO channel estimation problem. As such, the channel estimation problem was formulated as a quadratic nuclear norm optimization problem with linear constraint. Consequently, the regularization parameter, which minimizes the error between a data fidelity and convex penalty function, is selected based on cross-validation (CV) curve method. The simulation results demonstrate that the proposed method outperforms the LS method in terms of the estimator performance. In addition, the proposed method reduces the pilot length and the computational cost as well.
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.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 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".