Skip to content
Open access

Achievable Rates of Coded NOMA With Finite-Alphabet Inputs and Suboptimal Detection

2026 · IEEE Transactions on Communications · Vol 74, pp. 13392-13407 · 1 citation · 39 references
Computer Science

TL;DR

A NOMA–OMA crossover theorem is established: unlike the Gaussian case where NOMA always achieves a higher sum rate, with CC inputs there exists a per-user crossover SNR below which pooled-power orthogonal multiple access (OMA) outperforms NOMA for the power-disadvantaged user even with optimal MAP detection.

Abstract

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 reshapes the achievable rate landscape in ways the Gaussian theory does not predict. This paper establishes a hierarchy of detector-dependent achievable rates for uplink NOMA with constellation-constrained (CC) inputs: <inline-formula> <tex-math notation="LaTeX">$R_{\mathrm {TIN}} \leq R_{\mathrm {MMSE}} \leq R_{\mathrm {MAP}} \leq R_{\mathrm {oracle}} \leq \log _{2} M$ </tex-math></inline-formula>. We prove a calibration catastrophe for hard-decision SIC: the generalized mutual information (GMI) at the unscaled LLR magnitude becomes negative when the LLR-sign bit-error probability exceeds a closed-form threshold <inline-formula> <tex-math notation="LaTeX">$p_{e}^{\ast }(L_{\max })$ </tex-math></inline-formula>, meaning the decoder is actively misled by overconfident wrong LLRs. For the weak user with <inline-formula> <tex-math notation="LaTeX">$p_{e} \approx 0.3$ </tex-math></inline-formula>, the unscaled hard SIC GMI is approximately −7.66 bits per bit, rendering the practical hard-SIC decoder family infeasible for any code rate <inline-formula> <tex-math notation="LaTeX">$R \geq 1/2$ </tex-math></inline-formula>. We establish a NOMA–OMA crossover theorem: unlike the Gaussian case where NOMA always achieves a higher sum rate, with CC inputs there exists a per-user crossover SNR below which pooled-power orthogonal multiple access (OMA) outperforms NOMA for the power-disadvantaged user even with optimal MAP detection. Numerical results with LDPC coding confirm the theoretical predictions: MAP turbo detection achieves a waterfall BER consistent with the achievable rate analysis, hard SIC exhibits an error floor above 30% explained by its negative GMI, and the OMA baseline validates the crossover phenomenon.

Read PDF

Similar papers

Open access 2026

Covariance-Aware Fixed-Cardinality IRS Design With Quantized Phases for Multiuser MISO and MIMO Systems

This paper develops a covariance-aware, exact-cardinality design for multiuser MISO and multi-stream MIMO downlinks that outperforms static and energy-ranked subsets while retaining most of the corresponding full-surface quantized-phase rate with fewer controlled cells.

Z. Albataineh, Jamil K. J. Bataineh, M. A. Al Bataineh et al. · 0 citations
Sep 2026

Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold

We prove that exact block recovery in the square Gaussian binary MIMO model can be achieved in polynomial time at the same first-order SNR threshold as exhaustive maximum-likelihood detection. Specifically, for $y=\sqrt{\rho/N}Hx^\star+w, \; x^\star\in\{\pm1\}^N,$ and independent standard Gaussian $H\in\mathbb R^{N\tim...

Dimitris Papailiopoulos · 0 citations
Open access 2026

Common-Rate Constrained Cramér–Rao Bound Minimization for Multicast MIMO ISAC

We study Cramér–Rao bound (CRB) minimization under common-rate and power constraints for the multicast MIMO downlink. Under a covariance-matched nonparametric extended-target model, the trace CRB equals <inline-formula><tex-math notation="LaTeX">$c\,\text{tr}(\mathbf {S}^{-1})$</tex-math></inline-formula> and is attain...

Daeyoung Park · 0 citations
Open access 2026

Codeword Design for SIC-Based Multiple Access With Bounded Pairwise Overlap and Spatial Coupling

Through extensive simulations, it is demonstrated that the stable throughput achieved by the proposed deterministic scheme closely approaches the density-evolution threshold of randomized convolutional coded Poisson receivers (CCPR), including spatially coupled <inline-formula> <tex-math notation="LaTeX">$D$ </tex-math...

Bo Yang, Cheng-Shang Chang, Duan-Shin Lee · 0 citations
Preprint Oct 2026

Performance Analysis of MR-NOMA with Arbitrary Number of Users and Symbol Rates

This paper analytically investigates the bit error rate (BER) performance of downlink multi-rate (MR)-non-orthogonal multiple access (NOMA) over Nakagami-m fading channels for an arbitrary number of users and symbol rates to offer greater flexibility in user pairing while maintaining reliable BER performance and accomm...

Zainab Khader, A. Al-Dweik, E. Alsusa · 0 citations
Sep 2026

Capacity of a Mixed Multiple-Access Channel with Causal Observation

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...

Xian-Wei Meng · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.