New bounds improve error rates for multiuser Gaussian communication channels

Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels

Information Theory

Summary

Communication over wireless networks involves sending messages from multiple users to a receiver or from one sender to many receivers. The authors studied how well these messages can be sent when the message length is short, which is important for fast and reliable communication. They introduced a new method for constructing messages and decoding them that allows exact calculation of error probabilities without complex computations. Their work also compares different decoding approaches and shows how improvements for single users can help in multiuser scenarios.

What this means in practice

  • For wireless communication engineers: Evaluate and design multiuser communication systems with precise error performance for short message lengths using the proposed coding and decoding bounds.
  • For network protocol designers: Improve protocols for multiuser message transmission by incorporating tighter error bounds that distinguish between successive interference cancellation and joint decoding strategies.

Authors

Kaixuan Bao, Wei Xu, Xiaohu You

Abstract

This paper investigates non-asymptotic achievable rate regions of Gaussian multiple-access channels (MACs) and broadcast channels (BCs) in the finite-blocklength regime. By employing a proposed volume-uniform random coding (VURC) codebook that distributes codewords uniformly within an $n$-dimensional power sphere, together with successive interference cancellation (SIC) decoding, we derive a closed-form achievability bound, a scheme-specific lower bound on the average error probability, and a fourth-order asymptotic characterization. The proposed SIC achievability bound admits a simple and analytically interpretable closed-form expression, enabling direct performance evaluation without iterative computation. The structure of the proposed SIC asymptotic bound offers a highly extensible framework, allowing advances in single-user finite-blocklength theory to be systematically incorporated into the multiuser setting. Futhermore, to characterize the performance benefit of joint decoding, we further derive numerical and closed-form achievability bounds for the two-user Gaussian MAC under joint nearest-neighbor (JNN) decoding. Numerical results illustrate the performance differences among the proposed SIC and JNN bounds and existing benchmarks.