Asynchronous Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes
Pei Yang, Dongning Guo, Hongwen Yang

TL;DR
This paper introduces a Reed-Muller code-based scheme for massive device access in multi-cell wireless networks, enabling efficient identification and decoding of messages from numerous devices with improved complexity and error performance.
Contribution
It proposes a novel Reed-Muller sequence-based coding scheme combined with an iterative decoding algorithm for grant-free massive access in 5G networks.
Findings
Supports up to 2^{m(m+3)/2} devices with unique codewords
Achieves better computational complexity than existing algorithms
Provides improved error performance in device identification and message decoding
Abstract
Providing connectivity to a massive number of devices is a key challenge in 5G wireless systems. In particular, it is crucial to develop efficient methods for active device identification and message decoding in a multi-cell network with fading, path loss, and delay uncertainties. This paper presents such a scheme using second-order Reed-Muller (RM) sequences and orthogonal frequency-division multiplexing (OFDM). For given positive integer , a codebook is generated with up to codewords of length , where each codeword is a unique RM sequence determined by a matrix-vector pair with binary entries. This allows every device to send bits of information where an arbitrary number of these bits can be used to represent the identity of a node, and the remaining bits represent a message. There can be up to different identities. Using an iterative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT Networks and Protocols · Advanced Wireless Communication Technologies · Cooperative Communication and Network Coding
