Fronthaul Data Reduction in Massive MIMO Aided C-RAN via Two-timescale Hybrid Compression
Bibliographic record
Abstract
In massive MIMO aided cloud radio access network (C-RAN), plenty of remote radio heads (RRHs), each equipped with a massive MIMO array, are distributed within a specific geographical area and are connected to a centralized baseband unit (BBU) pool through fronthaul links. One major performance bottleneck in the uplink of massive MIMO aided C-RAN is that, the RRHs need to transport a huge amount of data to the BBU for baseband processings. Existing fronthaul compression methods that rely on fully-digital processing are not suitable for the massive MIMO regime due to their high implementation cost. To overcome this challenge, we propose a two-timescale hybrid analog-and-digital spatial compression scheme at RRHs to reduce the fronthaul data, where the analog filter is updated at a slow timescale according to the channel statistics to achieve massive MIMO array gain, and the digital filter is updated at a fast timescale according to the instantaneous effective channel state information (CSI) to achieve spatial multiplexing gain. Such a design can alleviate the performance bottleneck of limited fronthaul with reduced hardware cost and power consumption, and is more robust to the CSI delay. We propose an online algorithm for the two-timescale non-convex optimization of analog and digital filters. Simulations verify the advantages of the proposed scheme over state-of-the-art baseline schemes.
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.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 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".