New results on low complexity detectors for over-saturated CDMA systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper analyzes two different low-complexity multiuser detection schemes for the oversaturated synchronous CDMA systems, ie, systems which can accommodate more users than the processing gain of the system. The first scheme is multistage iterative alternative detection of the users of the two groups combined with interference cancellation. The bit-error rate performance analysis of this scheme using Gaussian approximation is also derived and it is shown that this scheme is the realization of the space altering generalized expectation maximization algorithm known in signal processing literature. As an improvement for the shortcomings of the first scheme in near-far situations, a group orthogonal sequence allocation scheme is introduced. It is demonstrated that it can lead to efficient optimal multiuser detection. It is also shown that if all groups of sequences attain the Welch bound for the sum of squared sequence correlation coefficients then the optimal joint multiuser detection maximizes the sum capacity of the channel.
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.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 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 it