2021/09/21 by Alexander Fengler, Fengler, Alexander, Osman Musa +5 · 1 citation
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2109.10108
openalex publication_date 2021/09/21 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
In this work we treat the unsourced random access problem on a Rayleigh\nblock-fading AWGN channel with multiple receive antennas. Specifically, we\nconsider the slowly fading scenario where the coherence block-length is large\ncompared to the number of active users and the message can be transmitted in\none coherence block. Unsourced random access refers to a form of grant-free\nrandom access where users are considered to be a-priori indistinguishable and\nthe receiver recovers a list of transmitted messages up to permutation. In this\nwork we show that, when the coherence block length is large enough, a\nconventional approach based on the transmission of non-orthogonal pilot\nsequences with subsequent channel estimation and Maximum-Ratio-Combining (MRC)\nprovides a simple energy-efficient solution whose performance can be well\napproximated in closed form. Furthermore, we analyse the MRC step when\nsuccessive interference cancellation (SIC) is done in groups, which allows to\nstrike a balance between receiver complexity and reduced transmit powers.\nFinally, we investigate the impact of power control policies taking into\naccount the unique nature of massive random access, including short message\nlengths, uncoordinated transmission, a very large amount of concurrent\ntransmitters with unknown identities, channel estimation errors and decoding\nerrors. As a byproduct we also present an extension of the MMV-AMP algorithm\nwhich allows to treat pathloss coefficients as deterministic unknowns by\nperforming maximum likelihood estimation in each step of the MMV-AMP algorithm.\n