pith. sign in

arxiv: 2606.26777 · v1 · pith:JGUBXOB6new · submitted 2026-06-25 · 💻 cs.IT · math.IT

An Orthogonal Approximate Message Passing Framework for Multiuser Communications

Burak \c{C}akmak , Hao Yan , Alexander Fengler , Giuseppe Caire , Lei Liu This is my paper

Pith reviewed 2026-06-26 02:48 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords approximate message passingmultiuser communicationsBayes optimalityreplica symmetric ansatzsignal recoveryrandom precodingexpectation propagation
0
0 comments X

The pith

A new OAMP/VAMP algorithm decouples multiuser recovery into independent scalar channels and is asymptotically Bayes-optimal under the replica-symmetric ansatz.

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

The paper constructs an iterative recovery method for linear-Gaussian multiuser systems whose precoding matrices are drawn from a right-unitarily invariant ensemble and whose user signals follow general non-factorizing distributions. The method is an interpolation between expectation propagation and orthogonal approximate message passing. Its explicit high-dimensional analysis produces a decoupling principle that matches the one obtained from a replica-symmetric ansatz analysis of the same inference problem. This common decoupling shows that the algorithm attains the Bayes-optimal performance in the large-system limit whenever the replica-symmetric ansatz is valid.

Core claim

The proposed OAMP/VAMP-type framework induces a decoupling principle that renders the algorithm asymptotically Bayes-optimal for the given multiuser model whenever the replica-symmetric ansatz holds; both the rigorous finite-sample analysis of the algorithm and the RS ansatz analysis arrive at the identical decoupling.

What carries the argument

The OAMP/VAMP framework, which interpolates between Minka's expectation propagation and OAMP and whose high-dimensional state evolution yields the decoupling principle.

If this is right

  • The algorithm applies directly to coded multiuser systems whose signals do not factorize across users.
  • The same decoupling holds for a wide class of time-varying and dispersive channels, including multiple-antenna settings.
  • The finite-sample analysis supplies explicit state-evolution recursions that track the algorithm's performance without requiring the large-system limit to be taken first.
  • The result closes the open question of constructing a provably Bayes-optimal iterative receiver for random right-unitarily invariant precoding.

Where Pith is reading between the lines

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

  • The decoupling may extend to other random-matrix ensembles that admit similar unitary invariance.
  • The interpolation view between EP and OAMP suggests a tunable family of algorithms whose optimality region could be mapped by varying the interpolation parameter.
  • Because the analysis is finite-sample yet asymptotic, it supplies a concrete route to non-asymptotic error bounds once concentration inequalities for the state evolution are added.

Load-bearing premise

The replica-symmetric ansatz is valid for the underlying inference problem.

What would settle it

A concrete high-dimensional simulation in which the algorithm's achieved error rate deviates from the Bayes-optimal error rate predicted by the replica-symmetric ansatz.

Figures

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

Figure 1
Figure 1. Figure 1: Time-invariant channels: MU-OAMP vs. OFDMA (QPSK signals, [PITH_FULL_IMAGE:figures/full_fig_p026_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Time-varying Channes: MU-OAMP vs. OAMP (QPSK signals, [PITH_FULL_IMAGE:figures/full_fig_p026_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Time-varying Channels: MSE (SR-LDPC signals, [PITH_FULL_IMAGE:figures/full_fig_p027_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Time-varying Channels: BER (SR-LDPC signals, [PITH_FULL_IMAGE:figures/full_fig_p027_4.png] view at source ↗
read the original abstract

We solve the open problem of constructing a Bayes-optimal iterative signal recovery algorithm for linear-Gaussian \emph{multiuser} communication systems with random precoding at the transmitters. Specifically, we consider the received signal model $\mathbf{y} = \sum_{u} \mathbf{H}_u \mathbf{\Xi}_u \mathbf{s}_u + \mathbf{n}$, where $\mathbf{n}$ is white Gaussian noise, $\{\mathbf{H}_u \in \mathbb{C}^{L \times L}\}$ are discrete-time channel matrices -- modeling a wide class of generally time-varying and dispersive linear channels with possibly multiple antennas -- and the precoding matrices $\{\boldsymbol{\Xi}_u \in \mathbb{C}^{L \times N_u}\}$ are drawn independently from a right-unitarily invariant random matrix ensemble. We consider generic \emph{non-separable} (coded) systems where the users' signals $\{\mathbf{s}_u\}$ follow general (non-factorizing) distributions. For this model, we introduce a novel orthogonal/vector approximate message passing (OAMP/VAMP)-type framework, including an algorithm and its high-dimensional (but finite-sample) analysis. From an algorithmic standpoint, the proposed method can be interpreted as an \emph{interpolation} between Minka's expectation propagation (EP)--a widely used method in machine learning--and OAMP. Our main theoretical contribution is the explicit finite-sample analysis of the proposed algorithm. Furthermore, we analyze the associated inference problem via a replica-symmetric (RS) ansatz by using a novel disorder-averaging technique. Both the (rigorous) high-dimensional analysis of the algorithm and the RS ansatz reveal the same decoupling principle, establishing that the proposed algorithm is asymptotically Bayes-optimal under the validity of the RS ansatz.

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 / 2 minor

Summary. The paper claims to solve the open problem of constructing a Bayes-optimal iterative signal recovery algorithm for linear-Gaussian multiuser communication systems with random precoding at the transmitters. It considers the model y = sum_u H_u Ξ_u s_u + n with right-unitarily invariant precoders Ξ_u and generic non-separable (coded) signal distributions, introduces an OAMP/VAMP-type framework that interpolates between Minka's EP and OAMP, provides an explicit finite-sample high-dimensional analysis of the algorithm, and analyzes the inference problem via a replica-symmetric (RS) ansatz using a novel disorder-averaging technique. Both the rigorous analysis and the RS ansatz yield the same decoupling principle, establishing that the algorithm is asymptotically Bayes-optimal under the validity of the RS ansatz.

Significance. If the results hold, the work addresses a longstanding open problem by supplying a practical iterative algorithm with rigorous high-dimensional performance guarantees for a wide class of multiuser systems (including time-varying, dispersive, and MIMO channels). The explicit finite-sample analysis, the interpolation interpretation between EP and OAMP, and the alignment between the algorithmic state evolution and the RS prediction constitute clear strengths that could advance both theoretical understanding and implementation in communications.

major comments (1)
  1. [Abstract and RS ansatz section] Abstract and the section presenting the RS ansatz: the asymptotic Bayes-optimality conclusion is explicitly conditioned on the validity of the RS ansatz, yet the rigorous high-dimensional analysis only establishes that the proposed OAMP/VAMP interpolation achieves the state evolution predicted by that ansatz (under right-unitarily invariant precoders and the high-dimensional limit). No independent verification or sufficient conditions are supplied showing that the RS ansatz recovers the true Bayes marginals for generic non-separable coded signals; this assumption is load-bearing for the central optimality claim.
minor comments (2)
  1. [Model definition and analysis sections] The notation for the channel matrices H_u and precoders Ξ_u is introduced clearly in the model, but the subsequent sections should explicitly restate the right-unitary invariance assumption each time it is invoked in the state-evolution derivations to avoid ambiguity for readers.
  2. [Discussion or conclusions] A short discussion or citation list on known regimes where the RS ansatz has been validated (or fails) for non-separable priors would help readers assess the practical scope of the optimality result.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. We address the single major comment below.

read point-by-point responses

  1. Referee: [Abstract and RS ansatz section] Abstract and the section presenting the RS ansatz: the asymptotic Bayes-optimality conclusion is explicitly conditioned on the validity of the RS ansatz, yet the rigorous high-dimensional analysis only establishes that the proposed OAMP/VAMP interpolation achieves the state evolution predicted by that ansatz (under right-unitarily invariant precoders and the high-dimensional limit). No independent verification or sufficient conditions are supplied showing that the RS ansatz recovers the true Bayes marginals for generic non-separable coded signals; this assumption is load-bearing for the central optimality claim.

    Authors: We agree that the central optimality claim is conditional on the RS ansatz. The manuscript already states this explicitly in the abstract and the RS section. The rigorous finite-sample analysis establishes that the algorithm realizes the state evolution (and the associated decoupling) predicted by the RS ansatz under right-unitarily invariant precoders. We do not supply an independent proof that the RS ansatz yields the exact Bayes marginals for arbitrary non-separable coded signals, because verifying the exactness of RS for generic structured (non-factorizing) priors remains an open problem in statistical physics of inference and is outside the scope of the present work. Our contribution is the construction of an algorithm whose performance is provably described by the RS prediction, together with the novel disorder-averaging technique used to derive the RS equations. In the multiuser communications literature the RS ansatz is the standard tool for predicting achievable performance; the paper supplies the matching practical algorithm with high-dimensional guarantees. We will revise the introduction and conclusion with a short clarifying paragraph that reiterates the conditional nature of the optimality result and notes that exact RS verification for non-separable priors is left for future research. revision: partial

Circularity Check

0 steps flagged

No significant circularity; claims explicitly conditional on RS ansatz

full rationale

The paper states that both its rigorous high-dimensional analysis and the RS ansatz analysis produce the same decoupling principle, and concludes the algorithm is asymptotically Bayes-optimal 'under the validity of the RS ansatz.' This is an explicit conditioning rather than a claim that the work proves the RS ansatz holds for the non-separable model. No equations or steps in the provided text reduce a prediction to a fitted input by construction, import uniqueness via self-citation, or smuggle an ansatz through prior self-work. The derivation chain is self-contained once the stated assumptions (right-unitarily invariant precoders, high-dimensional limit, RS validity) are granted.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Central claim rests on the RS ansatz for optimality and standard high-dimensional assumptions for the analysis; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption Replica-symmetric (RS) ansatz for the inference problem
    Invoked to analyze the inference problem and establish the Bayes-optimality result via decoupling principle.
  • standard math Right-unitarily invariant random matrix ensemble for precoders and high-dimensional regime
    Assumed for the model and to enable the explicit finite-sample analysis.

pith-pipeline@v0.9.1-grok · 5865 in / 1224 out tokens · 69450 ms · 2026-06-26T02:48:09.187773+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

65 extracted references

  1. [1]

    Tse and P

    D. Tse and P. Viswanath,Fundamentals of wireless communication. Cambridge university press, 2005

    2005

  2. [2]

    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

  3. [3]

    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

  4. [4]

    Information-theoretic limits and vector approximate message-passing for high- dimensional time series,

    D. Tieplova, S. Lahiry, and J. Barbier, “Information-theoretic limits and vector approximate message-passing for high- dimensional time series,”IEEE Transactions on Information Theory, pp. 1–1, 2026. 58

    2026

  5. [5]

    Chikuse,Statistics on special manifolds

    Y . Chikuse,Statistics on special manifolds. Springer Science & Business Media, 2003, vol. 174

    2003

  6. [6]

    Sparse Regression LDPC Codes,

    J. R. Ebert, J.-F. Chamberland, and K. R. Narayanan, “Sparse Regression LDPC Codes,”IEEE Transactions on Information Theory, vol. 71, no. 1, pp. 167–191, Jan. 2025

    2025

  7. [7]

    A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,

    T. Tanaka, “A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,”IEEE Transactions on Information theory, vol. 48, no. 11, pp. 2888–2910, 2002

    2002

  8. [8]

    Support recovery with sparsely sampled free random matrices,

    A. M. Tulino, G. Caire, S. Verdú, and S. Shamai, “Support recovery with sparsely sampled free random matrices,”IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4243–4271, 2013

    2013

  9. [9]

    The replica-symmetric prediction for random linear estimation with gaussian matrices is exact,

    G. Reeves and H. D. Pfister, “The replica-symmetric prediction for random linear estimation with gaussian matrices is exact,”IEEE Transactions on Information Theory, vol. 65, no. 4, pp. 2252–2283, 2019

    2019

  10. [10]

    Mutual information and optimality of approximate message-passing in random linear estimation,

    J. Barbier, N. Macris, M. Dia, and F. Krzakala, “Mutual information and optimality of approximate message-passing in random linear estimation,”IEEE Transactions on Information Theory, vol. 66, no. 7, pp. 4270–4303, 2020

    2020

  11. [11]

    Random linear estimation with rotationally-invariant designs: Asymptotics at high temperature,

    Y . Li, Z. Fan, S. Sen, and Y . Wu, “Random linear estimation with rotationally-invariant designs: Asymptotics at high temperature,”IEEE Transactions on Information Theory, vol. 70, no. 3, pp. 2118–2153, 2024

    2024

  12. [12]

    A CDMA multiuser detection algorithm on the basis of belief propagation,

    Y . Kabashima, “A CDMA multiuser detection algorithm on the basis of belief propagation,”Journal of Physics A: Mathematical and General, vol. 36, no. 43, p. 11111, October 2003

    2003

  13. [13]

    Message-passing algorithms for compressed sensing,

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

    2009

  14. [14]

    A theory of solving tap equations for ising models with general invariant random matrices,

    M. Opper, B. Cakmak, and O. Winther, “A theory of solving tap equations for ising models with general invariant random matrices,”Journal of Physics A: Mathematical and Theoretical, vol. 49, no. 11, p. 114002, 2016

    2016

  15. [15]

    Approximate message passing algorithms for rotationally invariant matrices,

    Z. Fan, “Approximate message passing algorithms for rotationally invariant matrices,”The Annals of Statistics, vol. 50, no. 1, pp. 197–224, 2022

    2022

  16. [16]

    Orthogonal amp,

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

    2020

  17. [17]

    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

  18. [18]

    Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,

    K. Takeuchi, “Rigorous dynamics of expectation-propagation-based signal recovery from unitarily invariant measurements,” IEEE Transactions on Information Theory, vol. 66, no. 1, pp. 368–386, 2019

    2019

  19. [19]

    State evolution for approximate message passing with non-separable functions,

    R. Berthier, A. Montanari, and P.-M. Nguyen, “State evolution for approximate message passing with non-separable functions,”Information and Inference: A Journal of the IMA, vol. 9, no. 1, pp. 33–79, 01 2019

    2019

  20. [20]

    Dimension-free bounds for generalized first-order methods via gaussian coupling,

    G. Reeves, “Dimension-free bounds for generalized first-order methods via gaussian coupling,”arXiv e-prints, pp. arXiv– 2508, 2025

    2025

  21. [21]

    Plug-in estimation in high-dimensional linear inverse problems: A rigorous analysis,

    A. K. Fletcher, P. Pandit, S. Rangan, S. Sarkar, and P. Schniter, “Plug-in estimation in high-dimensional linear inverse problems: A rigorous analysis,”Advances in Neural Information Processing Systems, vol. 31, 2018

    2018

  22. [22]

    Divergence measures and message passing,

    T. Minkaet al., “Divergence measures and message passing,” 2005

    2005

  23. [24]

    A non-asymptotic analysis of generalized vector approximate message passing algorithms with rotationally invariant designs,

    C. Cademartori and C. Rush, “A non-asymptotic analysis of generalized vector approximate message passing algorithms with rotationally invariant designs,”IEEE Transactions on Information Theory, vol. 70, no. 8, pp. 5811–5856, 2024

    2024

  24. [25]

    A convergence analysis of approximate message passing with non-separable functions and applications to multi-class classification,

    B. Çakmak, Y . M. Lu, and M. Opper, “A convergence analysis of approximate message passing with non-separable functions and applications to multi-class classification,” in2024 IEEE International Symposium on Information Theory (ISIT), 2024, pp. 747–752. 59

    2024

  25. [26]

    Joint message detection and channel estimation for unsourced random access in cell-free user-centric wireless networks,

    B. Çakmak, E. Gkiouzepi, M. Opper, and G. Caire, “Joint message detection and channel estimation for unsourced random access in cell-free user-centric wireless networks,”IEEE Transactions on Information Theory, pp. 1–1, 2025

    2025

  26. [27]

    Householder dice: A matrix-free algorithm for simulating dynamics on gaussian and random orthogonal ensembles,

    Y . M. Lu, “Householder dice: A matrix-free algorithm for simulating dynamics on gaussian and random orthogonal ensembles,”IEEE Transactions on Information Theory, vol. 67, no. 12, pp. 8264–8272, 2021

    2021

  27. [28]

    Analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing,

    M. Vehkaperä, Y . Kabashima, and S. Chatterjee, “Analysis of regularized ls reconstruction and random matrix ensembles in compressed sensing,”IEEE Transactions on Information Theory, vol. 62, no. 4, pp. 2100–2124, 2016

    2016

  28. [29]

    Expectation consistent approximate inference

    M. Opper, O. Winther, and M. J. Jordan, “Expectation consistent approximate inference.”Journal of Machine Learning Research, vol. 6, no. 12, 2005

    2005

  29. [30]

    Adaptive tap equations,

    M. Opper and D. Saad, “Adaptive tap equations,”Advanced mean field methods: Theory and practice, pp. 85–98, 2001

    2001

  30. [31]

    On mmse crossing properties and implications in parallel vector gaussian channels,

    R. Bustin, M. Payaro, D. P. Palomar, and S. Shamai, “On mmse crossing properties and implications in parallel vector gaussian channels,”IEEE transactions on information theory, vol. 59, no. 2, pp. 818–844, 2012

    2012

  31. [32]

    Vershynin,High-dimensional probability: An introduction with applications in data science

    R. Vershynin,High-dimensional probability: An introduction with applications in data science. Cambridge University Press, 2018, vol. 47

    2018

  32. [33]

    Sub-weibull distributions: Generalizing sub-gaussian and sub- exponential properties to heavier tailed distributions,

    M. Vladimirova, S. Girard, H. Nguyen, and J. Arbel, “Sub-weibull distributions: Generalizing sub-gaussian and sub- exponential properties to heavier tailed distributions,”Stat, vol. 9, no. 1, p. e318, 2020

    2020

  33. [34]

    Erd ˝os and H.-T

    L. Erd ˝os and H.-T. Yau,A dynamical approach to random matrix theory. American Mathematical Soc., 2017, vol. 28

    2017

  34. [35]

    The lasso risk for gaussian matrices,

    M. Bayati and A. Montanari, “The lasso risk for gaussian matrices,”IEEE Transactions on Information Theory, vol. 58, no. 4, pp. 1997–2017, 2012

    1997

  35. [36]

    Learning gaussian mixtures with generalized linear models: Precise asymptotics in high-dimensions,

    B. Loureiro, G. Sicuro, C. Gerbelot, A. Pacco, F. Krzakala, and L. Zdeborová, “Learning gaussian mixtures with generalized linear models: Precise asymptotics in high-dimensions,”Advances in Neural Information Processing Systems, vol. 34, pp. 10 144–10 157, 2021

    2021

  36. [37]

    Asymptotic errors for teacher-student convex generalized linear models (or: How to prove kabashima’s replica formula),

    C. Gerbelot, A. Abbara, and F. Krzakala, “Asymptotic errors for teacher-student convex generalized linear models (or: How to prove kabashima’s replica formula),”IEEE Transactions on Information Theory, vol. 69, no. 3, pp. 1824–1852, 2022

    2022

  37. [38]

    Finite sample analysis of approximate message passing algorithms,

    C. Rush and R. Venkataramanan, “Finite sample analysis of approximate message passing algorithms,”IEEE Transactions on Information Theory, vol. 64, no. 11, pp. 7264–7286, 2018

    2018

  38. [39]

    State evolution for general approximate message passing algorithms, with applications to spatial coupling,

    A. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,”Information and Inference: A Journal of the IMA, vol. 2, no. 2, pp. 115–144, 2013

    2013

  39. [40]

    Geometrically uniform codes,

    G. D. Forney, “Geometrically uniform codes,”IEEE Transactions on Information Theory, vol. 37, no. 5, pp. 1241–1260, 2002

    2002

  40. [41]

    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

  41. [42]

    Sparse regression ldpc codes for the block-fading non-coherent simo channel,

    A. Fengler, B. Çakmak, and G. Caire, “Sparse regression ldpc codes for the block-fading non-coherent simo channel,” arXiv preprint arXiv:2509.16376, 2025

    arXiv 2025

  42. [43]

    The mutual information in random linear estimation,

    J. Barbier, M. Dia, N. Macris, and F. Krzakala, “The mutual information in random linear estimation,” in2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2016, pp. 625–632

    2016

  43. [44]

    Multiuser detection and statistical mechanics,

    D. Guo and S. Verdú, “Multiuser detection and statistical mechanics,”Communications, Information and Network Security, pp. 229–277, 2003

    2003

  44. [45]

    Statistical mechanics of map estimation: General replica ansatz,

    A. Bereyhi, R. R. Müller, and H. Schulz-Baldes, “Statistical mechanics of map estimation: General replica ansatz,”IEEE Transactions on Information Theory, vol. 65, no. 12, pp. 7896–7934, 2019. 60

    2019

  45. [46]

    A deterministic equivalent for the analysis of correlated mimo multiple access channels,

    R. Couillet, M. Debbah, and J. W. Silverstein, “A deterministic equivalent for the analysis of correlated mimo multiple access channels,”IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3493–3514, 2011

    2011

  46. [47]

    Free deterministic equivalents, rectangular random matrix models, and operator-valued free probability theory,

    R. Speicher and C. Vargas, “Free deterministic equivalents, rectangular random matrix models, and operator-valued free probability theory,”Random Matrices: Theory and Applications, vol. 1, no. 02, p. 1150008, 2012

    2012

  47. [48]

    Grenander,Toeplitz forms and their applications

    U. Grenander,Toeplitz forms and their applications. Univ of California Press, 1958

    1958

  48. [49]

    Optimal errors and phase transitions in high-dimensional generalized linear models,

    J. Barbier, F. Krzakala, N. Macris, L. Miolane, and L. Zdeborová, “Optimal errors and phase transitions in high-dimensional generalized linear models,”Proceedings of the National Academy of Sciences, vol. 116, no. 12, pp. 5451–5460, 2019

    2019

  49. [50]

    Otfs vs. ofdm in the presence of sparsity: A fair comparison,

    L. Gaudio, G. Colavolpe, and G. Caire, “Otfs vs. ofdm in the presence of sparsity: A fair comparison,”IEEE Transactions on Wireless Communications, vol. 21, no. 6, pp. 4410–4423, 2021

    2021

  50. [51]

    A unified multicarrier waveform framework for next-generation wireless networks: Principles, performance, and challenges,

    X. Zhang, H. Yin, Y . Tang, Y . Ge, Y . Zeng, M. Wen, Z. Liu, Y . L. Guan, H. Arslan, and G. Caire, “A unified multicarrier waveform framework for next-generation wireless networks: Principles, performance, and challenges,”IEEE Communications Surveys & Tutorials, 2026

    2026

  51. [52]

    TR 138 901 - V16.1.0 - 5G; Study on channel model for frequencies from 0.5 to 100 GHz (3GPP TR 38.901 version 16.1.0 Release 16)

    “TR 138 901 - V16.1.0 - 5G; Study on channel model for frequencies from 0.5 to 100 GHz (3GPP TR 38.901 version 16.1.0 Release 16).”

  52. [53]

    Memory-free dynamics for the Thouless-Anderson-Palmer equations of ising models with arbitrary rotation-invariant ensembles of random coupling matrices,

    B. Çakmak and M. Opper, “Memory-free dynamics for the Thouless-Anderson-Palmer equations of ising models with arbitrary rotation-invariant ensembles of random coupling matrices,”Phys. Rev. E, vol. 99, p. 062140, Jun 2019

    2019

  53. [54]

    Universality of approximate message passing algorithms and tensor networks,

    T. Wang, X. Zhong, and Z. Fan, “Universality of approximate message passing algorithms and tensor networks,”The Annals of Applied Probability, vol. 34, no. 4, pp. 3943–3994, 2024

    2024

  54. [55]

    Universality of approximate message passing with semirandom matrices,

    R. Dudeja, Y . M. Lu, and S. Sen, “Universality of approximate message passing with semirandom matrices,”The Annals of Probability, vol. 51, no. 5, pp. 1616–1683, 2023

    2023

  55. [56]

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

    H. Yan, L. Liu, Y . Liu, B. Çakmak, and G. Caire, “Capacity-region-achieving sparse regression codes for mimo multiple- access channels,”arXiv e-prints, pp. arXiv—, 2026

    2026

  56. [57]

    Asymptotically liberating sequences of random unitary matrices,

    G. W. Anderson and B. Farrell, “Asymptotically liberating sequences of random unitary matrices,”Advances in Mathematics, vol. 255, pp. 381–413, 2014

    2014

  57. [58]

    Universality laws for high-dimensional learning with random features,

    H. Hu and Y . M. Lu, “Universality laws for high-dimensional learning with random features,”IEEE Transactions on Information Theory, vol. 69, no. 3, pp. 1932–1964, 2022

    1932

  58. [59]

    Universality of approximate message passing algorithms and tensor networks,

    T. Wang, X. Zhong, and Z. Fan, “Universality of approximate message passing algorithms and tensor networks,”arXiv preprint arXiv:2206.13037, 2022

    arXiv 2022

  59. [60]

    Tao,Topics in random matrix theory

    T. Tao,Topics in random matrix theory. American Mathematical Society, 2023, vol. 132

    2023

  60. [61]

    E. S. Meckes,The random matrix theory of the classical compact groups. Cambridge University Press, 2019, vol. 218

    2019

  61. [62]

    Multi-source approximate message passing with random semi-unitary dictionaries,

    B. Çakmak and G. Caire, “Multi-source approximate message passing with random semi-unitary dictionaries,”arXiv preprint arXiv:2410.13021v2, 2025

    arXiv 2025

  62. [63]

    R. J. Muirhead,Aspects of multivariate statistical theory. John Wiley & Sons, 2009

    2009

  63. [64]

    J. A. Mingo and R. Speicher,Free probability and random matrices. Springer, 2017, vol. 35

    2017

  64. [65]

    Understanding phase transitions via mutual information and mmse,

    G. Reeves, H. D. Pfister, M. Rodrigues, and Y . Eldar, “Understanding phase transitions via mutual information and mmse,” Information-Theoretic Methods in Data Science, edited by MRD Rodrigues and YC Eldar (Cambridge University Press,

  65. [66]

    197–228, 2019

    p, pp. 197–228, 2019

    2019