.png){kind=icon}
返回
CRC-Aided Sparse Regression Codes for Unsourced Random Access
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3281495.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes. A hybrid decoder consisting of a successive cancellation algorithm and a simplified approximated message passing (AMP) algorithm is presented for inner SPARCs, and an improved tree decoder is proposed for outer CRC-BMST codes by introducing a pruning technique. Simulation results show the proposed coding scheme outperforms the coded compressed sensing (CCS) scheme with lower computational complexity.
Keyword:
Unsourced random access
sparse regression codes
CRC codes
block Markov superposition transmission
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
查看更多内容