Performance analysis of a reduced complexity SCMA decoder exploiting a low-complexity maximum-likelihood approximation
Bibliographic record
Abstract
This paper explores means of reducing the complexity of a Sparse Code Multiple Access (SCMA) decoder. SCMA was proposed to assist massive connectivity in 5G future wireless telecommunication standards. The existing SCMA decoding algorithm is based on the Message Passing Algorithm (MPA). It heavily relies on calculations of the exponential function to estimate the maximum likelihood decoded message. The exponential function typically requires a very wide dynamic range. MPA is reformulated by replacing exponentials with simpler functions. Implementation complexity of the proposed simplified SCMA decoder was characterized using Vivado HLS targeting FPGA implementations. Results reported in this paper show that this approximate algorithm utilizes 10 times fewer hardware resources than the original SCMA decoder and achieves an Area × Time complexity also reduced by a factor of 10. Moreover, when executed on a typical data-center processor, the run-time complexity is also reduced by a factor of 10. In terms of BER performance, up to 2.5 times improvement achieved for SNR less than 12 dB as well.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".