pith. sign in

arxiv: 1906.09494 · v1 · pith:6M3MKUKXnew · submitted 2019-06-22 · 💻 cs.IT · math.IT

Multi-Cell Sparse Activity Detection for Massive Random Access: Massive MIMO versus Cooperative MIMO

Zhilin Chen , Foad Sohrabi , Wei Yu This is my paper

Pith reviewed 2026-05-25 17:46 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords sparse activity detectionmassive MIMOcooperative MIMOapproximate message passinginter-cell interferencemachine-type communicationslog-likelihood ratiofronthaul quantization
0
0 comments X

The pith

Massive MIMO drives sparse activity detection error to zero with increasing antennas, while cooperative MIMO improves cell-edge performance with larger cooperation.

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

This paper compares massive MIMO and cooperative MIMO architectures for detecting sparse device activity in cellular machine-type communications using non-orthogonal signatures and the approximate message passing algorithm. In massive MIMO, each base station detects its own cell's users while treating inter-cell interference as noise. In cooperative MIMO, base stations forward log-likelihood ratios to a central unit for joint decisions. The paper analytically characterizes false alarm and missed detection probabilities for both, showing that massive MIMO reduces errors to zero as antennas grow and cooperative MIMO enhances cell-edge reliability as cooperation size increases. It also examines the impact of quantizing the log-likelihood ratios for finite fronthaul capacity and provides numerical comparisons in practical scenarios.

Core claim

As the number of antennas increases, a massive MIMO system effectively drives the detection error to zero, while as the cooperation size increases, the cooperative MIMO architecture mainly improves the cell-edge user performance. Numerical simulations suggest that cooperating three base stations achieves about the same cell-edge detection reliability as a non-cooperative massive MIMO system with four times the number of antennas per base station.

What carries the argument

Approximate message passing algorithm applied to the multi-cell sparse activity detection model, with analytic expressions for false alarm and missed detection probabilities under noise treatment in massive MIMO and shared LLRs in cooperative MIMO.

If this is right

  • As antenna count grows in massive MIMO, detection errors approach zero.
  • Increasing cooperation size in cooperative MIMO primarily benefits cell-edge users.
  • Quantizing LLRs for fronthaul affects the performance of cooperative MIMO.
  • Three cooperating BSs can match the cell-edge performance of a massive MIMO system with four times more antennas per BS in the studied scenario.

Where Pith is reading between the lines

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

  • Network designers might weigh antenna scaling against cooperation overhead depending on coverage priorities.
  • The comparison framework could extend to other detection algorithms beyond approximate message passing.

Load-bearing premise

The analytic characterization assumes the approximate message passing algorithm applies directly to the multi-cell sparse activity model with the stated interference treatment and that the system parameters allow the large-system analysis to hold.

What would settle it

A simulation or experiment showing whether detection error probability approaches zero as the number of antennas per base station increases to large values in the massive MIMO architecture.

Figures

Figures reproduced from arXiv: 1906.09494 by Foad Sohrabi, Wei Yu, Zhilin Chen.

Figure 1
Figure 1. Figure 1: Probability of false alarm versus probability of missed detection in a non-cooperative massive MIMO system with M = 8. Typical User 1 and Typical User 2 correspond to the user at 95-percentile and 50-percentile of the CDF curve, respectively. that the coherence block could be large enough to support long signature sequences transmission for massive random access. We illustrate the performance of the users … view at source ↗
Figure 3
Figure 3. Figure 3: The values of τ 2∞ under different detection ranges of the innermost BS for cooperative MIMO. erative MIMO system, where each BS detects the users from its own cell as well as six surrounding cells, and each BS is able to forward a subset of LLRs of the detected users to the CU perfectly. The legend “Coop. w/ 3 BSs” indicates that the number of BSs involved in the LLR aggregation for each user is three, i.… view at source ↗
Figure 5
Figure 5. Figure 5: Comparison of massive MIMO and cooperative MIMO with an increasing number of cooperative BSs in terms of cell-edge user performance. 0 10 20 30 40 50 60 70 Number of antennas per BS in massive MIMO 10-8 10-6 10-4 10-2 100 Probability of false alarm/missed detection Massive MIMO Coop. MIMO w/ 3BSs Coop. MIMO w/ 3BSs, M = 12 Coop. MIMO w/ 3BSs, M = 4 Coop. MIMO w/ 3BSs, M = 8 Coop. MIMO w/ 3BSs, M = 16 [PIT… view at source ↗
Figure 6
Figure 6. Figure 6: Comparison of cooperative MIMO and massive MIMO with an increasing number of BS antennas in terms of cell-edge user performance. MIMO system achieves a comparable detection performance to a massive MIMO system by using only around one fourth of the antennas per BS, when L is large. C. Impact of Limited Fronthaul We have so far compared massive MIMO and cooperative MIMO with ideal LLR forwarding. In this se… view at source ↗
Figure 9
Figure 9. Figure 9: CDF of the detection error with LLR quantization in cooperative [PITH_FULL_IMAGE:figures/full_fig_p013_9.png] view at source ↗
read the original abstract

This paper considers sparse device activity detection for cellular machine-type communications with non-orthogonal signatures using the approximate message passing algorithm. This paper compares two network architectures, massive multiple-input multiple-output (MIMO) and cooperative MIMO, in terms of their effectiveness in overcoming inter-cell interference. In the massive MIMO architecture, each base station (BS) detects only the users from its own cell while treating inter-cell interference as noise. In the cooperative MIMO architecture, each BS detects the users from neighboring cells as well; the detection results are then forwarded in the form of log-likelihood ratio (LLR) to a central unit where final decisions are made. This paper analytically characterizes the probabilities of false alarm and missed detection for both architectures. Numerical results validate the analytic characterization and show that as the number of antennas increases, a massive MIMO system effectively drives the detection error to zero, while as the cooperation size increases, the cooperative MIMO architecture mainly improves the cell-edge user performance. Moreover, this paper studies the effect of LLR quantization to account for the finite-capacity fronthaul. Numerical simulations of a practical scenario suggest that in that specific case cooperating three BSs in a cooperative MIMO system achieves about the same cell-edge detection reliability as a non-cooperative massive MIMO system with four times the number of antennas per BS.

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

2 major / 2 minor

Summary. The paper compares massive MIMO (treating inter-cell interference as noise) and cooperative MIMO (with LLR exchange to a central unit) architectures for sparse device activity detection in multi-cell mMTC using the AMP algorithm. It analytically characterizes false-alarm and missed-detection probabilities for both, validates them numerically, examines LLR quantization effects on fronthaul, and reports that increasing antennas drives detection error to zero in massive MIMO while increasing cooperation size primarily benefits cell-edge users in the cooperative case; a specific simulation claims that 3-BS cooperation achieves cell-edge reliability comparable to a non-cooperative massive MIMO system with 4× antennas per BS.

Significance. If the AMP-based characterizations hold under the stated models, the work offers concrete architecture trade-offs and scaling insights for activity detection in dense mMTC networks, including a practical performance equivalence result and the impact of finite fronthaul quantization. These could inform BS deployment and cooperation strategies, with the numerical validation providing a bridge to realistic scenarios.

major comments (2)
  1. [analysis of false alarm and missed detection probabilities] The central analytic claims rest on applying standard AMP state evolution to the multi-cell sparse activity model. The effective observation after treating inter-cell interference as additional Gaussian noise (massive MIMO case) or after quantized LLR sharing (cooperative case) must still satisfy the i.i.d. sub-Gaussian matrix and separable denoiser conditions for the state-evolution recursion to be valid; without an explicit verification or derivation of the modified state evolution for the multi-cell pilot matrix in the analysis section, the closed-form FA/MD expressions and the claimed scaling laws (including the 3-BS vs. 4×-antenna equivalence) cannot be confirmed as load-bearing.
  2. [numerical results] The numerical simulation result that 'cooperating three BSs ... achieves about the same cell-edge detection reliability as a non-cooperative massive MIMO system with four times the number of antennas per BS' is presented without reported error bars, number of Monte-Carlo trials, or explicit parameter values (e.g., pilot length, activity probability, SNR regime); this undermines the quantitative equivalence claim that is used to illustrate the architecture comparison.
minor comments (2)
  1. Clarify the precise large-system limit assumptions (e.g., M, N, K scaling) under which the analytic FA/MD expressions are derived, as these are needed to assess when the finite-system simulations are expected to match the theory.
  2. The abstract states that the paper 'analytically characterizes' the probabilities, but the provided text does not include the explicit state-evolution recursions or the final closed-form expressions; ensure these appear with numbered equations in the main body.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below and will revise the manuscript to incorporate the suggested improvements.

read point-by-point responses

  1. Referee: [analysis of false alarm and missed detection probabilities] The central analytic claims rest on applying standard AMP state evolution to the multi-cell sparse activity model. The effective observation after treating inter-cell interference as additional Gaussian noise (massive MIMO case) or after quantized LLR sharing (cooperative case) must still satisfy the i.i.d. sub-Gaussian matrix and separable denoiser conditions for the state-evolution recursion to be valid; without an explicit verification or derivation of the modified state evolution for the multi-cell pilot matrix in the analysis section, the closed-form FA/MD expressions and the claimed scaling laws (including the 3-BS vs. 4×-antenna equivalence) cannot be confirmed as load-bearing.

    Authors: We agree that an explicit verification of the state-evolution conditions would strengthen the analytic claims. In the manuscript, the pilot matrix is constructed from i.i.d. sub-Gaussian entries in both architectures, and the per-user activity detection denoiser remains separable. For the massive MIMO case, inter-cell interference is folded into an effective Gaussian noise term whose variance enters the state evolution; this preserves the required matrix and denoiser properties under the large-system limit. For the cooperative case, local AMP detections at each BS are followed by LLR exchange (with optional quantization), and the final decision rule at the central unit is analyzed separately. To address the concern directly, we will add a short derivation in the revised analysis section confirming that the effective observation models satisfy the i.i.d. sub-Gaussian and separable-denoiser conditions, thereby supporting the closed-form FA/MD expressions and scaling laws. revision: yes

  2. Referee: [numerical results] The numerical simulation result that 'cooperating three BSs ... achieves about the same cell-edge detection reliability as a non-cooperative massive MIMO system with four times the number of antennas per BS' is presented without reported error bars, number of Monte-Carlo trials, or explicit parameter values (e.g., pilot length, activity probability, SNR regime); this undermines the quantitative equivalence claim that is used to illustrate the architecture comparison.

    Authors: The referee is correct that the presentation of this particular numerical result would be improved by including the missing methodological details. While the general simulation parameters (pilot length, activity probability, SNR regime) appear in Section V, the specific equivalence claim for the 3-BS cooperative versus 4×-antenna massive MIMO case does not report the number of Monte-Carlo trials or display error bars. In the revision we will (i) state the number of trials explicitly, (ii) add error bars to the relevant plot, and (iii) restate the full parameter set in the figure caption or accompanying text so that the quantitative claim is fully reproducible. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected in derivation chain

full rationale

The paper applies standard approximate message passing (AMP) state-evolution analysis to derive closed-form asymptotic expressions for false-alarm and missed-detection probabilities under the two architectures (treating inter-cell interference as noise in massive MIMO; exchanging quantized LLRs in cooperative MIMO). These expressions follow directly from the known AMP recursion on the effective observation model and are not obtained by fitting parameters to the target error rates or by redefining the outputs in terms of themselves. The scaling claims (error to zero with antennas; cell-edge improvement with cooperation) are consequences of the derived formulas, which are then validated by separate numerical simulations. No self-citation load-bearing step, no ansatz smuggled via prior work, and no renaming of known results as new derivations appear in the provided text. The analysis is self-contained against external AMP theory.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, new entities, or ad-hoc axioms beyond the standard use of AMP for sparse detection; any underlying assumptions on large-system limits or interference modeling are not detailed.

axioms (1)
  • domain assumption Approximate message passing algorithm applies to the multi-cell sparse activity detection problem with the described interference models
    The paper states it uses AMP for detection in both architectures.

pith-pipeline@v0.9.0 · 5764 in / 1319 out tokens · 25867 ms · 2026-05-25T17:46:40.111884+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

27 extracted references · 27 canonical work pages · 2 internal anchors

  1. [1]

    Sparse activity detection for massive connectivity in cellular networks: Multi-cell cooperation vs. large-scale antenna arrays,

    Z. Chen, F. Sohrabi, and W. Yu, “Sparse activity detection for massive connectivity in cellular networks: Multi-cell cooperation vs. large-scale antenna arrays,” in Proc. IEEE Inter. Conf. Acoustics Speech and Signal Process. (ICASSP), Calgary, Canada, Apr. 2018

    work page 2018

  2. [2]

    Toward massive, ultrareliable, and low-latency wireless communication with short packets,

    G. Durisi, T. Koch, and P. Popovski, “Toward massive, ultrareliable, and low-latency wireless communication with short packets,” Proc. IEEE , vol. 104, no. 9, pp. 1711–1726, Sep. 2016

    work page 2016

  3. [3]

    Massive non- orthogonal multiple access for cellular IoT: Potentials and limitations,

    M. Shirvanimoghaddam, M. Dohler, and S. J. Johnson, “Massive non- orthogonal multiple access for cellular IoT: Potentials and limitations,” IEEE Commun. Mag. , vol. 55, no. 9, pp. 55–61, 2017

    work page 2017

  4. [4]

    On the fundamental limits of massive connectivity,

    W. Yu, “On the fundamental limits of massive connectivity,” in Proc. Inf. Theory and Appl. (ITA) Workshop, San Diego, CA, USA, Feb. 2017, pp. 1–6

    work page 2017

  5. [5]

    The role of small cells, coordinated multipoint, and massive MIMO in 5G,

    V . Jungnickel, K. Manolakis, W. Zirwas, B. Panzner, V . Braun, M. Los- sow, M. Sternad, R. Apelfr¨ojd, and T. Svensson, “The role of small cells, coordinated multipoint, and massive MIMO in 5G,” IEEE Commun. Mag., vol. 52, no. 5, pp. 44–51, May 2014

    work page 2014

  6. [6]

    Large-scale MIMO versus network MIMO for multicell interference mitigation,

    K. Hosseini, W. Yu, and R. S. Adve, “Large-scale MIMO versus network MIMO for multicell interference mitigation,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 930–941, Oct. 2014

    work page 2014

  7. [7]

    Compres- sive sensing multi-user detection for multicarrier systems in sporadic machine type communication,

    F. Monsees, M. Woltering, C. Bockelmann, and A. Dekorsy, “Compres- sive sensing multi-user detection for multicarrier systems in sporadic machine type communication,” in Proc. IEEE Veh. Technol. Conf. (VTC Spring), May 2015, pp. 1–5

    work page 2015

  8. [8]

    Sparse signal process- ing concepts for efficient 5G system design,

    G. Wunder, H. Boche, T. Strohmer, and P. Jung, “Sparse signal process- ing concepts for efficient 5G system design,” IEEE Access , vol. 3, pp. 195–208, Feb. 2015

    work page 2015

  9. [9]

    Exploiting sparse user activity in multiuser detection,

    H. Zhu and G. B. Giannakis, “Exploiting sparse user activity in multiuser detection,” IEEE Trans. Commun. , vol. 59, no. 2, pp. 454–465, Feb. 2011

    work page 2011

  10. [10]

    Sparse activity detection for massive connectivity,

    Z. Chen, F. Sohrabi, and W. Yu, “Sparse activity detection for massive connectivity,” IEEE Trans. Signal Process. , vol. 66, no. 7, pp. 1890– 1904, Apr. 2018

    work page 1904

  11. [11]

    User activity detection in massive random access: Compressed sensing vs. coded slotted ALOHA,

    V . Boljanovi ´c, D. Vukobratovi ´c, P. Popovski, and ˇC. Stefanovi ´c, “User activity detection in massive random access: Compressed sensing vs. coded slotted ALOHA,” in Proc. IEEE Workshop Signal Process. Adv. Wireless Commun. (SPAWC), Sapporo, Japan, Jul. 2017, pp. 1–6

    work page 2017

  12. [12]

    Massive connectivity with massive MIMO —Part I: Device activity detection and channel estimation,

    L. Liu and W. Yu, “Massive connectivity with massive MIMO —Part I: Device activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 66, no. 11, pp. 2933–2946, Jun. 2018

    work page 2018

  13. [13]

    A random access protocol for pilot allocation in crowded massive MIMO systems,

    E. Bj ¨ornson, E. de Carvalho, J. H. Sørensen, E. G. Larsson, and P. Popovski, “A random access protocol for pilot allocation in crowded massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 16, no. 4, pp. 2220–2234, Apr. 2017

    work page 2017

  14. [14]

    Wireless Channel Dynamics and Robustness for Ultra-Reliable Low-Latency Communications

    S. Haghighatshoar, P. Jung, and G. Caire, “A new scaling law for activity detection in massive MIMO systems,” [Online] available: https://arxiv.org/abs/1806.08777, 2018

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  15. [15]

    Device activity and embedded information bit detection using AMP in massive MIMO,

    K. Senel and E. G. Larsson, “Device activity and embedded information bit detection using AMP in massive MIMO,” in Proc. IEEE Globecom (GC) Workshops, Singapore, Dec. 2017, pp. 1–6

    work page 2017

  16. [16]

    Active user detection and channel es- timation in uplink CRAN systems,

    X. Xu, X. Rao, and V . K. N. Lau, “Active user detection and channel es- timation in uplink CRAN systems,” in Proc. IEEE Inter. Conf. Commun. (ICC), London, UK, June 2015, pp. 2727–2732

    work page 2015

  17. [17]

    Random access in C-RAN for user activity detection with limited-capacity fronthaul,

    Z. Utkovski, O. Simeone, T. Dimitrova, and P. Popovski, “Random access in C-RAN for user activity detection with limited-capacity fronthaul,” IEEE Signal Process. Lett. , vol. 24, no. 1, pp. 17–21, Jan. 2017

    work page 2017

  18. [18]

    Capacity of Gaussian many-access channels,

    X. Chen, T.-Y . Chen, and D. Guo, “Capacity of Gaussian many-access channels,” IEEE Trans. Inf. Theory, vol. 63, no. 6, pp. 3516–3539, June 2017

    work page 2017

  19. [19]

    A perspective on massive random-access,

    Y . Polyanskiy, “A perspective on massive random-access,” in Proc. IEEE Inter. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017, pp. 2523– 2527

    work page 2017

  20. [20]

    Low complexity schemes for the random access Gaussian channel,

    O. Ordentlich and Y . Polyanskiy, “Low complexity schemes for the random access Gaussian channel,” in Proc. IEEE Inter. Symp. Inf. Theory (ISIT), Aachen, Germany, Jun. 2017, pp. 2528–2532

    work page 2017

  21. [21]

    Overcoming interference in spatial multiplexing MIMO cellular networks,

    J. G. Andrews, W. Choi, and R. W. Heath, “Overcoming interference in spatial multiplexing MIMO cellular networks,” IEEE Wireless Commun., vol. 14, no. 6, pp. 95–104, Dec. 2007

    work page 2007

  22. [22]

    Message-passing algorithms for compressed sensing,

    D. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, Nov. 2009

    work page 2009

  23. [23]

    Generalized approximate message passing for estimation with random linear mixing,

    S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE Inter. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, July 2011, pp. 2168–2172

    work page 2011

  24. [24]

    Belief propagation for joint sparse recovery

    J. Kim, W. Chang, B. Jung, D. Baron, and J. C. Ye, “Be- lief propagation for joint sparse recovery,” [Online] available: http://arxiv.org/abs/1102.3289v1, 2011

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  25. [25]

    Asymptotic analysis of complex LASSO via complex approximate message passing (CAMP),

    A. Maleki, L. Anitori, Z. Yang, and R. G. Baraniuk, “Asymptotic analysis of complex LASSO via complex approximate message passing (CAMP),” IEEE Trans. Inf. Theory , vol. 59, no. 7, pp. 4290–4308, July 2013

    work page 2013

  26. [26]

    Efficient high-dimensional inference in the multiple measurement vector problem,

    J. Ziniel and P. Schniter, “Efficient high-dimensional inference in the multiple measurement vector problem,” IEEE Trans. Signal Process. , vol. 61, no. 2, pp. 340–354, Jan. 2013

    work page 2013

  27. [27]

    Massive MIMO: ten myths and one critical question,

    E. Bj ¨ornson, E. G. Larsson, and T. L. Marzetta, “Massive MIMO: ten myths and one critical question,” IEEE Commun Mag , vol. 54, no. 2, pp. 114–123, Feb. 2016

    work page 2016