pith. machine review for the scientific record. sign in

arxiv: 2604.11062 · v1 · submitted 2026-04-13 · 💻 cs.IT · math.IT

Recognition: 2 theorem links

· Lean Theorem

Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels

Hao Yan , Lei Liu , Yuhao Liu , Burak \c{C}akmak , Giuseppe Caire
Authors on Pith no claims yet

Pith reviewed 2026-05-10 16:40 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords sparse regression codesMIMO multiple-access channelscapacity regionMA-OAMPparallel interference cancellationpower allocation
0
0 comments X

The pith

Sparse regression codes achieve the full capacity region of MIMO multiple-access channels via MA-OAMP and time sharing.

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

The paper proposes a framework where sparse regression codes, each used by a single user, reach the capacity limits of MIMO multiple-access channels. Random semi-unitary dictionary matrices enable the MA-OAMP receiver to carry out reliable parallel interference cancellation. The authors derive an optimal coding principle that attains the sum capacity, and with time sharing extends to the whole capacity region. They then construct a scheme that achieves this through targeted power allocation on position-modulated signals.

Core claim

With random semi-unitary dictionary matrices applied for encoding, multiple-access OAMP (MA-OAMP) enables reliable parallel interference cancellation at the receiver. An optimal coding principle with the MA-OAMP receiver, which achieves the sum capacity and, in combination with time sharing, achieves the entire capacity region, is established as the guiding principle for designing capacity-region-achieving codes. Accordingly, a coding scheme for capacity-region-achieving SR codes is proposed via proper power allocation over the position-modulated signals.

What carries the argument

MA-OAMP receiver enabling reliable parallel interference cancellation with random semi-unitary dictionary matrices for sparse regression encoding.

If this is right

  • The scheme achieves the sum capacity of the MIMO-MAC.
  • Combined with time sharing, it achieves the entire capacity region.
  • A practical scheme is given using power allocation over position-modulated signals.

Where Pith is reading between the lines

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

  • This framework may extend to other multi-user settings where parallel interference cancellation is feasible.
  • The reliance on random semi-unitary matrices suggests testing sensitivity to matrix design in hardware implementations.
  • Power allocation over position-modulated signals could be adapted for dynamic rate allocation in varying channel conditions.

Load-bearing premise

MA-OAMP enables reliable parallel interference cancellation at the receiver when using random semi-unitary dictionary matrices for encoding.

What would settle it

A simulation or analysis showing that the achievable rate falls short of the sum capacity when the proposed power allocation and MA-OAMP are applied at rates near the theoretical limit.

Figures

Figures reproduced from arXiv: 2604.11062 by Burak \c{C}akmak, Giuseppe Caire, Hao Yan, Lei Liu, Yuhao Liu.

Figure 1
Figure 1. Figure 1: Achievable rate supremum R sup u for user u in Lemma 2. As illustrated in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: BERs in a two-user 2 × 2 MIMO-MAC. The limit SNR is 10 dB. The randomly selected target rate tuple is Rsup = (4.704, 2.354) bits/sym. The power gains are (0, −3) dB. The SR code parameters are (B1, L1) = (1783, 1783) and (B2, L2) = (971, 971). The underlying LDPC codes have rates RLDPC = (1.1760, 1.1768) bits/sym and lengths (32768,16384), yielding symbol sequence lengths (8192,8192) and spectral efficienc… view at source ↗
read the original abstract

This paper proposes a coding framework for capacity-region-achieving sparse regression (SR) codes over MIMO multiple-access channels (MIMO-MAC), where a single SR code is used for each user at the transmitter. With random semi-unitary dictionary matrices applied for encoding, multiple-access OAMP (MA-OAMP) enables reliable parallel interference cancellation (PIC) at the receiver. Theoretically, an optimal coding principle with the MA-OAMP receiver, which achieves the sum capacity and, in combination with time sharing, achieves the entire capacity region, is established as the guiding principle for designing capacity-region-achieving codes. Accordingly, a coding scheme for capacity-region-achieving SR codes is proposed via proper power allocation over the position-modulated signals.

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

3 major / 2 minor

Summary. The paper proposes a coding framework for MIMO multiple-access channels that employs a single sparse regression (SR) code per user, random semi-unitary dictionary matrices for encoding, and a multiple-access orthogonal approximate message passing (MA-OAMP) receiver to perform parallel interference cancellation. It claims to establish an optimal coding principle under which the MA-OAMP receiver achieves the sum-capacity corner point of the MIMO-MAC capacity region; combined with time sharing, this yields the entire capacity region. A concrete scheme realizing this principle is given via power allocation over the position-modulated signals of the SR code.

Significance. If the central claims are rigorously established, the work would supply a constructive, capacity-region-achieving coding scheme for MIMO-MAC based on SR codes, extending prior single-user OAMP and SR-code results to the multi-user setting. The explicit power-allocation construction is a concrete, implementable contribution that could guide practical code design.

major comments (3)
  1. [Theoretical development of MA-OAMP receiver (around the optimality principle)] The manuscript asserts that MA-OAMP with random semi-unitary dictionaries performs reliable parallel interference cancellation, allowing each user's effective channel to approach the single-user MIMO channel whose mutual information equals the sum-capacity corner point. However, no state-evolution recursion, fixed-point analysis, or large-system limit argument is supplied to show that residual interference variance vanishes. This derivation is load-bearing for the sum-capacity claim.
  2. [Statement and proof of the optimal coding principle] The optimal coding principle is presented as achieving the sum capacity directly from the MA-OAMP structure, yet the reduction from the multi-user MIMO-MAC to the effective single-user channel is not derived explicitly; the argument instead relies on the unshown convergence property above. This circularity affects the claim that the principle, together with time sharing, achieves the full capacity region.
  3. [Coding scheme via power allocation] The proposed power-allocation scheme over position-modulated signals is claimed to realize the optimal principle, but no optimality proof, closed-form expression, or comparison against other allocations (e.g., uniform power) is given to confirm it attains the sum-capacity corner point.
minor comments (2)
  1. [Abstract and Introduction] The abstract and introduction would benefit from a brief statement of the large-system regime assumptions (e.g., dimensions, sparsity rate) under which the MA-OAMP convergence is expected to hold.
  2. [System model] Notation for the semi-unitary dictionary matrices and the position-modulated signals should be introduced with explicit dimensions and normalization conditions to avoid ambiguity in later sections.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. The comments highlight important aspects of the theoretical development that we will clarify and strengthen in the revision. We respond to each major comment below.

read point-by-point responses

  1. Referee: [Theoretical development of MA-OAMP receiver (around the optimality principle)] The manuscript asserts that MA-OAMP with random semi-unitary dictionaries performs reliable parallel interference cancellation, allowing each user's effective channel to approach the single-user MIMO channel whose mutual information equals the sum-capacity corner point. However, no state-evolution recursion, fixed-point analysis, or large-system limit argument is supplied to show that residual interference variance vanishes. This derivation is load-bearing for the sum-capacity claim.

    Authors: We agree that an explicit state-evolution analysis is necessary to rigorously confirm the vanishing of residual interference. The manuscript relies on the orthogonality properties of the random semi-unitary dictionaries and the structure of MA-OAMP to argue that the effective channels decouple in the large-system limit. In the revised version we will add the full state-evolution recursion, the associated fixed-point equations, and the large-system limit argument establishing that the interference variance converges to zero. revision: yes

  2. Referee: [Statement and proof of the optimal coding principle] The optimal coding principle is presented as achieving the sum capacity directly from the MA-OAMP structure, yet the reduction from the multi-user MIMO-MAC to the effective single-user channel is not derived explicitly; the argument instead relies on the unshown convergence property above. This circularity affects the claim that the principle, together with time sharing, achieves the full capacity region.

    Authors: The optimal coding principle is defined with respect to the effective single-user MIMO channel that results once parallel interference cancellation is successful. We will insert an explicit, step-by-step derivation of the channel reduction from the original MIMO-MAC to this equivalent single-user channel, making the logical dependence on the convergence result transparent and removing any appearance of circularity. The time-sharing argument for the full capacity region will be restated after this derivation. revision: yes

  3. Referee: [Coding scheme via power allocation] The proposed power-allocation scheme over position-modulated signals is claimed to realize the optimal principle, but no optimality proof, closed-form expression, or comparison against other allocations (e.g., uniform power) is given to confirm it attains the sum-capacity corner point.

    Authors: The power-allocation rule is constructed so that the position-modulated signals meet the power levels required by the optimal coding principle. We will augment the manuscript with a formal optimality proof for this allocation, a closed-form expression for the allocated powers, and a comparison against uniform power allocation that demonstrates attainment of the target sum-capacity corner point. revision: yes

Circularity Check

1 steps flagged

MA-OAMP PIC reliability asserted via prior OAMP extension; central capacity claim load-bearing on that assumption

specific steps
  1. self citation load bearing [Abstract]
    "With random semi-unitary dictionary matrices applied for encoding, multiple-access OAMP (MA-OAMP) enables reliable parallel interference cancellation (PIC) at the receiver. Theoretically, an optimal coding principle with the MA-OAMP receiver, which achieves the sum capacity and, in combination with time sharing, achieves the entire capacity region, is established as the guiding principle for designing capacity-region-achieving codes."

    The sentence asserts MA-OAMP enables reliable PIC as a premise, then immediately uses that premise to 'establish' the optimal coding principle that achieves sum capacity. No new state-evolution analysis or fixed-point proof for the MIMO-MAC setting is supplied in the quoted text; the enabling property is therefore imported (via self-citation to prior OAMP/SR work by overlapping authors) rather than derived here, making the capacity-region claim reduce to that imported assumption.

full rationale

The paper's derivation establishes an optimal coding principle that achieves sum capacity (and full region via time-sharing) specifically because MA-OAMP with semi-unitary dictionaries is stated to enable reliable PIC, reducing each user's effective channel to a single-user MIMO channel whose MI equals the sum-capacity corner point. This property is presented as given rather than re-derived via new state-evolution recursion or fixed-point analysis for the multi-user MIMO-MAC case. The subsequent power-allocation scheme for SR codes follows directly from that principle. No self-definitional loops, fitted-parameter predictions, or ansatz smuggling appear; the central claim retains independent content once the MA-OAMP property is granted, but the property itself rests on an unverified extension of prior OAMP results (likely self-cited by overlapping authors). Hence moderate circularity.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claim rests on domain assumptions about random semi-unitary matrices and MA-OAMP convergence; power allocation is introduced as a design choice without independent derivation shown.

free parameters (1)
  • power allocation over position-modulated signals
    Proper power allocation is required to achieve the stated capacity result.
axioms (2)
  • domain assumption Random semi-unitary dictionary matrices enable effective encoding for SR codes
    Stated as applied for encoding in the framework.
  • domain assumption MA-OAMP enables reliable parallel interference cancellation
    Key premise for the receiver to support the capacity claim.

pith-pipeline@v0.9.0 · 5433 in / 1231 out tokens · 42060 ms · 2026-05-10T16:40:13.682132+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.

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

33 extracted references

  1. [1]

    Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,

    C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1,” inProceedings of ICC ’93 - IEEE International Conference on Communications, vol. 2, 1993, pp. 1064–1070 vol.2

    1993

  2. [2]

    The capacity of low-density parity- check codes under message-passing decoding,

    T. Richardson and R. Urbanke, “The capacity of low-density parity- check codes under message-passing decoding,”IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 599–618, 2001

    2001

  3. [3]

    Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,

    S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,”IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 803–834, 2011

    2011

  4. [4]

    Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,

    E. Arikan, “Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,”IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051–3073, 2009

    2009

  5. [5]

    Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity,

    A. Joseph and A. R. Barron, “Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity,”IEEE Transactions on Information Theory, vol. 58, no. 5, pp. 2541–2557, 2012

    2012

  6. [6]

    Fast sparse superposition codes have near exponential error probability forR <C,

    ——, “Fast sparse superposition codes have near exponential error probability forR <C,”IEEE Transactions on Information Theory, vol. 60, no. 2, pp. 919–942, 2014

    2014

  7. [7]

    Message-passing algo- rithms for compressed sensing,

    D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algo- rithms for compressed sensing,”Proceedings of the National Academy of Sciences, vol. 106, pp. 18 914 – 18 919, 2009

    2009

  8. [8]

    Message passing algorithms for compressed sensing: I. motiva- tion and construction,

    ——, “Message passing algorithms for compressed sensing: I. motiva- tion and construction,” in2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo), 2010, pp. 1–5

    2010

  9. [9]

    Capacity-achieving sparse superposition codes via approximate message passing decoding,

    C. Rush, A. Greig, and R. Venkataramanan, “Capacity-achieving sparse superposition codes via approximate message passing decoding,”IEEE Transactions on Information Theory, vol. 63, no. 3, pp. 1476–1500, 2017

    2017

  10. [10]

    The error probability of sparse superposition codes with approximate message passing decoding,

    C. Rush and R. Venkataramanan, “The error probability of sparse superposition codes with approximate message passing decoding,”IEEE Transactions on Information Theory, vol. 65, no. 5, pp. 3278–3303, 2019

    2019

  11. [11]

    Approximate message-passing decoder and capacity achieving sparse superposition codes,

    J. Barbier and F. Krzakala, “Approximate message-passing decoder and capacity achieving sparse superposition codes,”IEEE Transactions on Information Theory, vol. 63, no. 8, pp. 4894–4927, 2017

    2017

  12. [12]

    Sparse regres- sion codes,

    R. Venkataramanan, S. C. Tatikonda, and A. R. Barron, “Sparse regres- sion codes,”F ound. Trends Commun. Inf. Theory, vol. 15, pp. 1–195, 2019

    2019

  13. [13]

    Orthogonal AMP,

    J. Ma and L. Ping, “Orthogonal AMP,”IEEE Access, vol. 5, pp. 2020– 2033, 2017

    2020

  14. [14]

    Vector approximate message passing,

    S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,”IEEE Transactions on Information Theory, vol. 65, no. 10, pp. 6664–6684, 2019

    2019

  15. [15]

    Sparse superposition codes under V AMP decoding with generic rotational invariant coding matrices,

    T. Hou, Y . Liu, T. Fu, and J. Barbier, “Sparse superposition codes under V AMP decoding with generic rotational invariant coding matrices,” in 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 1372–1377

    2022

  16. [16]

    Capacity-achieving sparse regression codes via vector approximate message passing,

    Y . Xu, Y . Liu, S. Liang, T. Wu, B. Bai, J. Barbier, and T. Hou, “Capacity-achieving sparse regression codes via vector approximate message passing,”2023 IEEE International Symposium on Information Theory (ISIT), pp. 785–790, 2023

    2023

  17. [17]

    Capacity-achieving sparse superposition codes with spatially coupled vamp decoder,

    Y . Liu, T. Fu, J. Fan, P. Niu, C. Deng, and Z. Huang, “Capacity-achieving sparse superposition codes with spatially coupled vamp decoder,” in 2025 IEEE International Symposium on Information Theory (ISIT), 2025, pp. 1–6

    2025

  18. [18]

    SPARCs for unsourced random access,

    A. Fengler, P. Jung, and G. Caire, “SPARCs for unsourced random access,”IEEE Transactions on Information Theory, vol. 67, no. 10, pp. 6894–6915, 2021

    2021

  19. [19]

    Capacity-achieving MIMO-NOMA: Iterative LMMSE detection,

    L. Liu, Y . Chi, C. Yuen, Y . L. Guan, and Y . Li, “Capacity-achieving MIMO-NOMA: Iterative LMMSE detection,”IEEE Transactions on Signal Processing, vol. 67, no. 7, pp. 1758–1773, 2019

    2019

  20. [20]

    Achievable rate region for iterative multi-user detection via low-cost gaussian approximation,

    X. Wang, C. Liang, L. Ping, and S. ten Brink, “Achievable rate region for iterative multi-user detection via low-cost gaussian approximation,” IEEE Transactions on Wireless Communications, vol. 19, no. 5, pp. 3289–3303, 2020

    2020

  21. [21]

    Capacity optimality of AMP in coded systems,

    L. Liu, C. Liang, J. Ma, and L. Ping, “Capacity optimality of AMP in coded systems,”IEEE Transactions on Information Theory, vol. 67, no. 7, pp. 4429–4445, 2021

    2021

  22. [22]

    Constrained capacity optimal generalized multi-user MIMO: A theoretical and practi- cal framework,

    Y . Chi, L. Liu, G. Song, Y . Li, Y . L. Guan, and C. Yuen, “Constrained capacity optimal generalized multi-user MIMO: A theoretical and practi- cal framework,”IEEE Transactions on Communications, vol. 70, no. 12, pp. 8086–8104, 2022

    2022

  23. [23]

    On capacity optimality of OAMP: Beyond iid sensing matrices and gaussian signaling,

    L. Liu, S. Liang, and L. Ping, “On capacity optimality of OAMP: Beyond iid sensing matrices and gaussian signaling,”IEEE Transactions on Communications, vol. 72, no. 5, pp. 2519–2535, 2024

    2024

  24. [24]

    Memory AMP,

    L. Liu, S. Huang, and B. M. Kurkoski, “Memory AMP,”IEEE Trans- actions on Information Theory, vol. 68, no. 12, pp. 8015–8039, 2022

    2022

  25. [25]

    An orthogonal ap- proximate message passing framework for multi-user communications,

    B. C ¸ akmak, H. Yan, A. Fengler, G. Caire, and L. Liu, “An orthogonal ap- proximate message passing framework for multi-user communications,” 2026, manuscript in preparation

    2026

  26. [26]

    Spectral universality in regularized linear regression with nearly deterministic sensing matrices,

    R. Dudeja, S. Sen, and Y . M. Lu, “Spectral universality in regularized linear regression with nearly deterministic sensing matrices,”IEEE Transactions on Information Theory, vol. 70, no. 11, pp. 7923–7951, 2024

    2024

  27. [27]

    Random multiplexing,

    L. Liu, Y . Chi, S. Huang, and Z. Zhang, “Random multiplexing,”IEEE Transactions on Information Theory, vol. 72, no. 4, pp. 2277–2306, 2026

    2026

  28. [28]

    Tse and P

    D. Tse and P. Viswanath,Fundamentals of Wireless Communication. Cambridge University Press, 2005

    2005

  29. [29]

    T. M. Cover and J. A. Thomas,Elements of Information Theory. USA: Wiley-Interscience, 2006

    2006

  30. [30]

    Capacity-region- achieving sparse regression codes for MIMO multiple-access channels,

    H. Yan, L. Liu, Y . Liu, B. C ¸ akmak, and G. Caire, “Capacity-region- achieving sparse regression codes for MIMO multiple-access channels,” 2026, manuscript in preparation

    2026

  31. [31]

    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 Transactions on Infor- mation Theory, vol. 51, no. 4, pp. 1261–1282, 2005

    2005

  32. [32]

    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 Transactions on Information Theory, vol. 53, no. 1, pp. 22–38, 2007

    2007

  33. [33]

    Techniques for improving the finite length performance of sparse superposition codes,

    A. Greig and R. Venkataramanan, “Techniques for improving the finite length performance of sparse superposition codes,”IEEE Transactions on Communications, vol. 66, no. 3, pp. 905–917, 2018

    2018