Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Symbol-Level Noise-Guessing Decoding with Antenna Sorting for URLLC Massive MIMO (2305.13113v3)

Published 22 May 2023 in cs.IT, eess.SP, and math.IT

Abstract: Supporting ultra-reliable and low-latency communication (URLLC) is a challenge in current wireless systems. Channel codes that generate large codewords improve reliability but necessitate the use of interleavers, which introduce undesirable latency. Only short codewords can eliminate the requirement for interleaving and reduce decoding latency. This paper suggests a coding and decoding method which, when combined with the high spectral efficiency of spatial multiplexing, can provide URLLC over a fading channel. Random linear coding and high-order modulation are used to transmit information over a massive multiple-input multiple-output (mMIMO) channel, followed by zero-forcing detection and guessing random additive noise decoding (GRAND) at a receiver. A variant of GRAND, called symbol-level GRAND, originally proposed for single-antenna systems that employ high-order modulation schemes, is generalized to spatial multiplexing. The paper studies the impact of the orthogonality defect of the underlying mMIMO lattice on symbol-level GRAND, and proposes to leverage side-information that comes from the mMIMO channel-state information and relates to the reliability of each receive antenna. This induces an antenna sorting step, which further reduces decoding complexity by over 80\% when compared to bit-level GRAND.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
Citations (2)

Summary

We haven't generated a summary for this paper yet.