Low Complexity Techniques for SCMA Detection
Bibliographic record
Abstract
Sparse code multiple access (SCMA) is a codebook- based non-orthogonal multiplexing technique. In SCMA, the procedure of bit to QAM symbol mapping and spreading of CDMA are combined together and incoming bits are directly mapped to multi-dimensional codewords of SCMA codebook sets. Due to the sparse nature of codewords, SCMA enjoys the low complexity reception, taking advantage of a near optimal message passing algorithm (MPA). This makes SCMA a candidate for supporting massive connectivity in future 5G networks, where the number of users can potentially be higher than the codeword length (spreading factor). To this end, more efficient reception techniques are needed on top of what MPA delivers. In this paper, some complexity reduction techniques are presented to further reduce the SCMA decoding complexity. These techniques are considered from two perspectives: i) transmitter-side technique, by designing SCMA codebooks with a specific structure providing low complexity of detections, and ii) low complexity decoding techniques taking advantage of the SCMA codebook structure. The proposed techniques are evaluated in terms of both complexity and performance. It is shown that significant amount of complexity reduction is possible using the proposed techniques with negligible performance penalty, which paves the way of supporting various applications in future 5G systems using SCMA.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".