Iterative semi-blind multiuser detection using subspace approach for MC-CDMA uplink
Bibliographic record
Abstract
Iterative multiuser detection is a powerful signal processing technique to enhance the performance and capacity of coded CDMA systems. However, previously proposed iterative multiuser receivers have been based on complete knowledge of spreading codes of all users in the system. The performance of these receivers degrades significantly in the presence of unknown interference, caused by out-of-cell users whose spreading codes are not known. We propose two forms of iterative semi-blind multiuser receivers for such an uplink environment. The first is based on minimum mean square error criterion and the second is a hybrid scheme, based on a combination of parallel interference cancellation and linear multiuser detection. These receivers are derived using a subspace approach, which utilize known users' information for the computation of log-likelihood ratios, while blindly suppressing the unknown interference. We consider a multicarrier CDMA system, which has received considerable attention for future high-speed wireless systems. Simulation results demonstrate that the proposed iterative semi-blind methods offer substantial performance gain over that of conventional noniterative and non-blind iterative receivers.
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.002 |
| 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.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".