6 research outputs found
Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity
Unsourced random-access (U-RA) is a type of grant-free random access with a
virtually unlimited number of users, of which only a certain number are
active on the same time slot. Users employ exactly the same codebook, and the
task of the receiver is to decode the list of transmitted messages. Recently a
concatenated coding construction for U-RA on the AWGN channel was presented, in
which a sparse regression code (SPARC) is used as an inner code to create an
effective outer OR-channel. Then an outer code is used to resolve the
multiple-access interference in the OR-MAC. In this work we show that this
concatenated construction can achieve a vanishing per-user error probability in
the limit of large blocklength and a large number of active users at sum-rates
up to the symmetric Shannon capacity, i.e. as long as K_aR <
0.5\log_2(1+K_a\SNR). This extends previous point-to-point optimality results
about SPARCs to the unsourced multiuser scenario. Additionally, we calculate
the algorithmic threshold, that is a bound on the sum-rate up to which the
inner decoding can be done reliably with the low-complexity AMP algorithm.Comment: 7 pages, submitted to ISIT 2020. arXiv admin note: substantial text
overlap with arXiv:1901.0623
Massive Unsourced Random Access: Exploiting Angular Domain Sparsity
This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce system complexity; they operate under the framework of coupled compressed sensing (CCS) which concatenates an outer tree code to an inner compressed sensing code for slot-wise message stitching. We suggest that by exploiting the MIMO channel information in the angular domain, redundancies required by the tree encoder/decoder in CCS can be removed to improve spectral efficiency, thereby an uncoupled transmission protocol is devised. To perform activity detection and channel estimation, we propose an expectation-maximization-aided generalized approximate message passing algorithm with a Markov random field support structure, which captures the inherent clustered sparsity structure of the angular domain channel. Then, message reconstruction in the form of a clustering decoder is performed by recognizing slot-distributed channels of each active user based on similarity. We put forward the slot-balanced K-means algorithm as the kernel of the clustering decoder, resolving constraints and collisions specific to the application scene. Extensive simulations reveal that the proposed scheme achieves a better error performance at high spectral efficiency compared to the CCS-based URA schemes