pith. sign in

arxiv: 1907.09593 · v1 · pith:MCUIQV7Nnew · submitted 2019-07-22 · 💻 cs.IT · math.IT

Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation

Xiaojie Wang , Chulong Liang , Li Ping , Stephan ten Brink This is my paper

Pith reviewed 2026-05-24 17:41 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords IDMAEXIT chartGaussian approximationmulti-user detectionconservative vector fieldachievable rateiterative processingmultiple access channel
0
0 comments X

The pith

The achievable rate in IDMA with Gaussian-approximation detection equals the path-independent integral over a conservative MSE vector field.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that the K-dimensional tuples of mean-square errors for K users form a conservative vector field during iterative processing. Because the achievable rate serves as the potential function of this field, its value is fixed solely by the initial and final MSE points and does not depend on the particular integration path taken through the field. A reader would care because the result implies that a low-cost detector can reach the sum-rate capacity region for any valid path and that the choice of path supplies an additional degree of freedom when designing user codes.

Core claim

The K-dimensional tuples formed by the MSEs of K users constitute a conservative vector field. The achievable rate is a potential function of this conservative field, so it is the integral along any path in the field with value of the integral solely determined by the two path terminals.

What carries the argument

The conservative vector field whose components are the MSEs of the K users under Gaussian-approximation multi-user detection.

If this is right

  • Low-cost GA-based MUD can provide near capacity performance.
  • The sum-rate capacity region can be achieved independently of the integration path in the MSE fields.
  • The integration path supplies an extra degree of freedom for code design.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same conservative-field property may hold in other iterative multi-user schemes that rely on Gaussian approximations for interference.
  • Different paths could be chosen deliberately to emphasize fairness among users rather than pure sum rate.
  • Area calculations for convergence thresholds become simpler once the potential-function property is used.

Load-bearing premise

The line integral of the rate function between any two MSE points is independent of the path taken through the field.

What would settle it

Numerically integrate the rate function along two distinct paths that connect the same pair of initial and final MSE vectors and verify whether the resulting values are identical.

Figures

Figures reproduced from arXiv: 1907.09593 by Chulong Liang, Li Ping, Stephan ten Brink, Xiaojie Wang.

Figure 13
Figure 13. Figure 13: ]. Such overheads accumulate during SIC steps, [PITH_FULL_IMAGE:figures/full_fig_p001_13.png] view at source ↗
Figure 1
Figure 1. Figure 1: The iterative multi-user detection and decoding model. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustration (exemplary for two users) of different integration [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
read the original abstract

We establish a multi-user extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple-access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user detection (MUD) based on the Gaussian approximation (GA) is assumed. The evolution of mean-square errors (MSE) of the GA-based MUD during iterative processing is studied. We show that the K-dimensional tuples formed by the MSEs of K users constitute a conservative vector field. The achievable rate is a potential function of this conservative field, so it is the integral along any path in the field with value of the integral solely determined by the two path terminals. Optimized codes can be found given the integration paths in the MSE fields by matching EXIT type functions. The above findings imply that i) low-cost GA-based MUD can provide near capacity performance; ii) the sum-rate capacity (region) can be achieved independently of the integration path in the MSE fields; and iii) the integration path can be an extra degree of freedom for code design.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper establishes a multi-user EXIT chart area theorem for IDMA in MACs under low-cost GA MUD. It claims that the K-dimensional MSE tuples form a conservative vector field whose potential function is the achievable rate, so the rate equals the line integral between any two points in the MSE space and is path-independent. This is used to argue that GA-MUD achieves near sum-rate capacity independently of the integration path and that the path supplies an extra degree of freedom for code optimization via EXIT matching.

Significance. If the conservative-field property is rigorously established, the result supplies a clean theoretical explanation for the observed near-capacity behavior of GA-MUD and gives a principled way to optimize codes by choosing integration paths in the MSE domain. The path-independence claim, if verified, would be a useful addition to the EXIT-chart literature for multi-user systems.

major comments (1)
  1. [MSE evolution analysis and conservative-vector-field claim] The central claim that the MSE vector field is conservative (curl F = 0) is load-bearing for the path-independence of the rate integral. The manuscript asserts that the K-tuples constitute a conservative field and that the rate is the integral along any path, but supplies no explicit verification that the mixed partials of the GA update map F are identical (i.e., ∂F_i/∂x_j = ∂F_j/∂x_i) when powers are unequal or K>2. The GA-MUD functions arise from soft interference cancellation and variance expressions; their symmetry must be shown directly rather than assumed.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed and constructive review. The central issue raised concerns the lack of explicit verification for the conservative property of the MSE vector field. We address this below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [MSE evolution analysis and conservative-vector-field claim] The central claim that the MSE vector field is conservative (curl F = 0) is load-bearing for the path-independence of the rate integral. The manuscript asserts that the K-tuples constitute a conservative field and that the rate is the integral along any path, but supplies no explicit verification that the mixed partials of the GA update map F are identical (i.e., ∂F_i/∂x_j = ∂F_j/∂x_i) when powers are unequal or K>2. The GA-MUD functions arise from soft interference cancellation and variance expressions; their symmetry must be shown directly rather than assumed.

    Authors: We agree that an explicit verification of the mixed partials is required to rigorously establish the conservative property for general unequal powers and K>2, and that the manuscript does not supply this direct computation. The structural argument based on the GA-MUD is present, but the referee is correct that the symmetry of the partial derivatives must be shown explicitly. In the revised manuscript we will add a dedicated derivation: the interference variance for user i is V_i = sum_{j≠i} p_j x_j; the GA update F_i is a composition of the soft-cancellation and variance functions applied to V_i. Differentiating via the chain rule yields ∂F_i/∂x_j = (dF_i/dV_i) * p_j for j≠i. Because the cross terms are identical (∂V_i/∂x_j = p_j and ∂V_j/∂x_i = p_i, with the underlying functions depending symmetrically on the variances), the mixed partials satisfy ∂F_i/∂x_j = ∂F_j/∂x_i, confirming curl F = 0. This addition will be placed in the MSE-evolution section. revision: yes

Circularity Check

0 steps flagged

No circularity: conservative-field claim presented as independently shown

full rationale

The paper states it shows that the K-dimensional MSE tuples form a conservative vector field, from which the achievable rate follows as a path-independent potential. No quoted step reduces this showing to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation whose content is unverified. The central derivation is therefore treated as self-contained; the area theorem is not forced by construction from its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the unproven assertion that the MSE evolution under Gaussian approximation forms a conservative field; no free parameters, invented entities, or non-standard axioms are mentioned in the abstract.

axioms (1)
  • domain assumption The MSE evolution map under the Gaussian-approximation MUD defines a conservative vector field (curl zero).
    Invoked when the authors equate the achievable rate to a path-independent line integral.

pith-pipeline@v0.9.0 · 5726 in / 1314 out tokens · 40942 ms · 2026-05-24T17:41:16.526523+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel matches
    ?
    matches

    MATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.

    We show that the K-dimensional tuples formed by the MSEs of K users constitute a conservative vector field. The achievable rate is a potential function of this conservative field, so it is the integral along any path in the field with value of the integral solely determined by the two path terminals.

  • IndisputableMonolith/Foundation/LogicAsFunctionalEquation.lean Translation Theorem matches
    ?
    matches

    MATCHES: this paper passage directly uses, restates, or depends on the cited Recognition theorem or module.

    ∇_v log(σ² + gᵀv) = g/(gᵀv + σ²) … R_sum = log(1 + ∑ P_k |h_k|² / σ²) which is independent of the path

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Tse and P

    D. Tse and P. Viswanath, Fundamentals of Wireless Communi- cations. Cambridge University Press, 2005

    work page 2005

  2. [2]

    Interleave-Division Multiple Access (IDMA),

    Y . Hu and L. Ping, “Interleave-Division Multiple Access (IDMA),” in Multiple Access Techniques for 5G Wireless Net- works and Beyond , M. Vaezi, Z. Ding, and H. V . Poor, Eds. Springer, 2019, ch. 13, pp. 417–449

    work page 2019

  3. [3]

    Exploiting the Chain Rule of Mutual Information for the Design of Iterative Deoding Shemes,

    S. ten Brink, “Exploiting the Chain Rule of Mutual Information for the Design of Iterative Deoding Shemes,” in Proc. 39th Annual Allerton Conf. on Comm., Control and Computing , 2001

    work page 2001

  4. [4]

    De- sign of capacity-approaching irregular low-density parity-check codes,

    T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “De- sign of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619–637, Feb 2001

    work page 2001

  5. [5]

    Extrinsic informa- tion transfer functions: model and erasure channel properties,

    A. Ashikhmin, G. Kramer, and S. ten Brink, “Extrinsic informa- tion transfer functions: model and erasure channel properties,” IEEE Trans. Inform. Theory , vol. 50, no. 11, pp. 2657–2673, Nov 2004

    work page 2004

  6. [6]

    An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation,

    K. Bhattad and K. R. Narayanan, “An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation,” IEEE Trans. Inform. Theory , vol. 53, no. 1, pp. 22–38, Jan 2007

    work page 2007

  7. [7]

    Interleave division multiple-access,

    L. Ping, L. Liu, K. Wu, and W. K. Leung, “Interleave division multiple-access,” IEEE Trans. Wireless Commun. , vol. 5, no. 4, pp. 938–947, April 2006

    work page 2006

  8. [8]

    Approaching the capacity of multiple access channels using interleaved low-rate codes,

    L. Ping, L. Liu, K. Y . Wu, and W. K. Leung, “Approaching the capacity of multiple access channels using interleaved low-rate codes,” IEEE Comm. Letters , vol. 8, no. 1, pp. 4–6, Jan 2004

    work page 2004

  9. [9]

    Interleave- division multiple access in high rate applications,

    Y . Hu, C. Liang, L. Liu, C. Yan, Y . Yuan, and L. Ping, “Interleave- division multiple access in high rate applications,” IEEE Comm. Letters, 2018

    work page 2018

  10. [10]

    Capacity- achieving iterative LMMSE detection for MIMO-NOMA sys- tems,

    L. Liu, Y . Chi, C. Yuen, Y . L. Guan, and Y . Li, “Capacity- achieving iterative LMMSE detection for MIMO-NOMA sys- tems,” IEEE Trans. Signal Processing , 2019

    work page 2019

  11. [11]

    Mutual information and minimum mean-square error in Gaussian channels,

    D. Guo, S. Shamai, and S. Verdu, “Mutual information and minimum mean-square error in Gaussian channels,” IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1261–1282, April 2005

    work page 2005

  12. [12]

    Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection,

    X. Yuan, L. Ping, C. Xu, and A. Kavcic, “Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection,” IEEE Trans. Inform. Theory , vol. 60, no. 11, pp. 7073–7089, Nov 2014

    work page 2014

  13. [13]

    Superposition coded modulation and iterative linear MMSE detection,

    L. Ping, J. Tong, X. Yuan, and Q. Guo, “Superposition coded modulation and iterative linear MMSE detection,” IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 995–1004, August 2009

    work page 2009

  14. [14]

    Achievable rate region for iterative multi-user detection involving low-cost Gaus- sian approximation,

    X. J. Wang, C. Liang, L. Ping, and S. ten Brink, “Achievable rate region for iterative multi-user detection involving low-cost Gaus- sian approximation,” Journal Version, under preparation, avail- able online https://github.com/xjiewang/AchievableRate, 2019

    work page 2019

  15. [15]

    Evolution analysis of low-cost iterative equalization in coded linear systems with cyclic prefixes,

    X. Yuan, Q. Guo, X. Wang, and L. Ping, “Evolution analysis of low-cost iterative equalization in coded linear systems with cyclic prefixes,” IEEE J. Sel. Areas Commun. , vol. 26, no. 2, pp. 301–310, February 2008

    work page 2008