Deep Residual Neural Network Decoder for Sparse Code Multiple Access
Bibliographic record
Abstract
As an enabling technology for emerging and future generations of wireless networks, sparse code multiple access (SCMA) offers major improvements in terms of spectral efficiency and massive connectivity. Although the message passing algorithm (MPA) for SCMA decoding at the receiver side can achieve near optimum performance, it entails high computational complexity. In this paper, to address this issue, we propose a novel SCMA decoder based on deep residual neural network (ResNet), wherein the decoder is trained to predict the transmit codewords. In our approach, residual blocks are employed to tackle the problems of accuracy saturation and vanishing gradients with deep learning based decoder, while batch normalization is utilized to enhance the stability and robustness of the decoder. The performance of the proposed ResNet decoder for SCMA is validated by means of simulations over AWGN and Rayleigh fading channels. The results show that besides a much reduced complexity, the proposed decoder leads to improvements in term of bit error rate (BER) over competing deep neural network (DNN) based decoders.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".