Reduced-Complexity Belief Propagation for System-Wide MUD in the Uplink of Cellular Networks
Bibliographic record
Abstract
System-wide multiuser detection (MUD), in which all base stations (BSs) of a cellular system cooperate to detect the data of all mobile stations (MSs), has much promise. However, little is known at present about practical techniques or their performance. An attractive method is belief propagation (BP), with message exchange between nearby cooperating BSs over a backbone landline network, but its performance is known only for a greatly simplified network model and its computation load grows exponentially with the number of interfering MS symbols at each BS. In this paper, we present a reduced complexity variation of BP (RCBP) and show that its performance is close to or identical to that of BP in the simplified network. We also observe excellent performance by iterative multiuser detection and decoding of low-density parity check codes (LDPC). Furthermore, we examine RCBP performance in a realistic wireless network model, with path loss, shadowing, fading and power control. These results, though poorer than those of the simplified network, show that system-wide MUD with cooperating BSs provides great improvement compared with conventional systems.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.004 | 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 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".