Subspace decomposition approach to multi-user MIMO channel estimation in SC-FDE systems
Bibliographic record
Abstract
Multiuser multiple-input multiple-output (MU-MIMO) wireless systems that employ single-carrier frequency-domain equalization (SC-FDE) for uplink transmissions can provide high data rates with increased spectral efficiency under severe channel conditions. However, the availability of accurate channel estimates at the base station (BS) receiver is crucial for achieving peak performance. In this paper, we investigate the use of subspace decomposition and derive a novel algorithm for the blind estimation of MU-MIMO channels in SC-FDE systems, as specified by the 3GPP LTE. By exploiting the long data blocks available in LTE standards, our proposed blind algorithm can obtain accurate estimates of the MU-MIMO channels over every block of transmitted data. This provides for a bandwidth-efficient solution in SC-FDE systems by eliminating (reducing) the need to allocate an entire block of pilot sequences for each active transmitter. Furthermore, since the channel estimation is deployed at the BS, the computational complexity is not considered to be a significant burden for future systems in exchange for the increased spectral efficiency. The results of simulations over fading channels, using realistic system parameters representative of LTE-Advanced, demonstrate the advantages of our proposed blind subspace-based channel estimation algorithm and support the feasibility of the resulting MU-MIMO SC-FDE scheme with reduced training.
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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".