Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
