Blind detection of SCMA for uplink grant-free multiple-access
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
Sparse code multiple access (SCMA) is a new frequency domain non-orthogonal multiple-access technique which can enable massive connectivity and grant-free transmission in wireless radio access. With SCMA, different incoming data streams are directly mapped to codewords of different multi-dimensional cookbooks, where each codeword represents a spread transmission layer. Multiple SCMA layers share the same time-frequency resources of OFDMA. The sparsity of codewords allows low complexity of multi-layer detection for excessive codeword overloading which is the key feature to enable massive connectivity. In this paper, a blind detection solution is introduced and analyzed to support massive connectivity in a SCMA-based UL grant-free multiple access. The proposed solution is based on two major components: i) blind detection of active pilots/users with reasonable complexity, and ii) blind decoding of active users' data with no knowledge of active codebook set. Different activity detection algorithms and schemes are proposed, described, and analyzed. Simulation results are provided to evaluate the performance of the proposed schemes in various scenarios. Our analysis and performance evaluation confirm the proposed SCMA-based blind reception solution is a promising technology to enable massive connectivity for grant-free multiple-access transmission mode in future wireless networks.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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