.png){kind=icon}
.png){kind=icon}
Return
Low-Complexity Coding and Spreading for Unsourced Random Access
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3039436.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a low-complexity unsourced random access (URA) transmission scheme where the data payload, encoded by an error-reduction code, undergoes repetition, permutation, and spreading. An approach to perform spatial graph coupling of the URA messages via randomized message delays is also presented. The proposed system, in either block or coupled form, outperforms the existing URA counterparts in the high multi-user interference regime and provides a substantial increase in the supported multi-user loads. A choice of stronger, albeit more complex, error-correction code allows for performance improvements at lower system loads. Finally, system performance predictions via a state-evolution analysis are also demonstrated.
Keywords:
Multiuser detection
Iterative decoding
Encoding
Receivers
Decoding
Couplings
Signal to noise ratio
Unsourced random access
error-reduction coding
spatial graph coupling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W