To characterize the performance benefit of joint decoding, numerical and closed-form achievability bounds for the two-user Gaussian MAC under joint nearest-neighbor (JNN) decoding are derived and performance differences among the proposed SIC and JNN bounds are illustrated.
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.
This paper characterizes the second-order coding region of the scalar Gaussian broadcast channel along the curved boundary of its capacity region. The characterization holds under both average and maximal error criteria and allows correlation between the receiver noises. At each interior point of this boundary, the sec...
This achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guill\'en i F\`abregas, with an optimization over admissible power splits, and establishes the optimality of the resulting coded time-sharing strategy.
We construct a universal decoder for cyclic Gaussian multiple-input multiple-output channels with intersymbol interference and unknown channel taps and spatial noise covariance. Codewords are drawn independently and uniformly from a sphere of fixed total energy. Under stated bounds on frequency variation, the decoder a...
We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal...
Sparse Code Multiple Access (SCMA) is a promising non-orthogonal multiplexing technique for enhancing connectivity and spectral efficiency in next-generation communication networks. This paper proposes near-optimal uplink SCMA codebook designs based on a novel deep neural network (DNN)-assisted framework. The DNN is tr...
Practical finite-length fading blocks and emerging short-blocklength services raise urgent demands for innovating the infinite-blocklength capacity in user-centric cell-free massive MIMO (CFmMIMO). Existing works mainly introduced a classical channel dispersion based loss term with simplified uplink processing, which l...
Yu Zhang, Miao-Ran Peng, Guo-Chao Song et al.· IEEE Transactions on Communi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.