A finite structural characterization of the U-user multiuser channel-capacity region appears here, and it is shown that maximum rate sum for any Gaussian multiple-user-channel derives from simple iterative procedures.
Abstract
A finite structural characterization of the $U$-user multiuser channel-capacity region appears here. This region relies upon three concepts: (i) subset-based message atomization, (ii) synchronized receiver chain-rule/Fano reduction, and (iii) successive-decoding achievability via a finite-super-symbol closure. The resulting region is a finite union of order-indexed polytopes parameterized by the synchronized minimum mutual-information vector $\mathcal{I}_{\min}$. The framework removes auxiliary-random-variable proliferation and makes explicit the finite geometric structure underlying general multiuser converses, with the interference channel providing the primary illustration. For the linear matrix Gaussian multiuser-channel special case under per-user trace covariance constraints, Gaussian signaling is capacity-region-achieving within this framework. Also shown is that maximum rate sum for any Gaussian multiple-user-channel derives from simple iterative procedures.
We establish exact second-order coding rate regions at the two corner points of the capacity region of the two-user Gaussian multiple-access channel. For any average error probability $\varepsilon\in(0,1)$, we characterize the $n^{-1/2}$-scale fluctuations of achievable rates around each corner point, proving a convers...
We determine the capacity region of a mixed binary multiple-access channel whose receiver can choose how each observation is formed. Two ports reveal the sum modulo two of the transmitted symbols with retention probabilities $\pg>\pb$; their roles are interchanged by an unknown state that remains fixed during the block...
A one-shot (finite-blocklength) channel-coding framework based on the pairwise error probability (PEP) of a decoder with randomized tie-breaking that recovers several classical one-shot bounds, including the random-coding union bound and minimax meta-converse of Polyanskiy-Poor-Verdu, the information-spectrum bounds of...
Power-domain non-orthogonal multiple access (NOMA) is conventionally analyzed under Gaussian input assumptions, where successive interference cancellation (SIC) achieves the multiple-access channel (MAC) capacity region. Practical systems, however, employ finite-alphabet modulations and suboptimal detectors, which resh...
Liang Dong· IEEE Transactions on Communi...· 1 citation
Power-domain non-orthogonal multiple access (NOMA) relies on successive interference cancellation (SIC) at the receiver, leading to the prevailing but incomplete view that power allocation merely enables SIC. This paper develops an information-theoretic framework for the detection limits of power-domain NOMA under fini...
Liang Dong, Robert W. Heath· IEEE Transactions on Communi...· 1 citation
We completely characterize the second-order coding rate region of the two-user Gaussian multiple-access channel at points in the relative interior of the sum-rate face, under maximal per-codeword power constraints. For any fixed average error probability $0<\varepsilon<1/2$, a nontrivial mixture of power splits reduces...
Vincent Y. F. Tan· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
