pith. sign in

arxiv: 2603.17082 · v2 · submitted 2026-03-17 · 📡 eess.SP

CRB-Based Resource Allocation in Multi-User Uplink Transmissions

Xue Zhang , Abla Kammoun , Mohamed-Slim Alouini This is my paper

Pith reviewed 2026-05-15 09:21 UTC · model grok-4.3

classification 📡 eess.SP
keywords Cramér-Rao boundresource allocationrandom matrix theorymulti-user uplinkpower allocationchannel estimationsymbol estimation
0
0 comments X

The pith

CRB-based proxies guide asymptotic power allocation in multi-user uplink systems

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

The paper examines receiver design for uplink multi-user systems that must estimate both the channel and the transmitted symbols. It considers two strategies, joint estimation of channel and symbols together and sequential estimation where the channel is found first. For each, it derives the Cramér-Rao bound on symbol estimation to set a performance floor. When no receiver meets this bound exactly, the same bound is used as a practical proxy for throughput. Random matrix theory is then applied to find how these bounds behave in large-system limits, which produces simple power allocation guidelines that maximize the proxies.

Core claim

By deriving the Cramér-Rao bound on symbol estimation for both joint and sequential channel-symbol estimation strategies and then applying random matrix theory to study the asymptotic behavior of these bounds across various large-system regimes, the work obtains generic power allocation guidelines that asymptotically maximize the CRB-based proxy metrics for achievable throughput.

What carries the argument

Cramér-Rao bound (CRB) on symbol estimation, treated as a throughput proxy and analyzed with random matrix theory to produce asymptotic power allocation guidelines for both estimation strategies.

If this is right

  • Power allocation can be performed using closed-form asymptotic expressions rather than exhaustive search over finite parameters.
  • The same guidelines apply to both joint and sequential estimation strategies.
  • Simulation results confirm that the asymptotic expressions remain accurate for practical system sizes.
  • The proxies allow optimization even when no receiver can achieve the CRB exactly.

Where Pith is reading between the lines

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

  • The guidelines may reduce the complexity of resource management in large wireless networks by replacing iterative optimization with direct rules.
  • Similar CRB-plus-random-matrix analysis could be applied to downlink or multi-cell scenarios with comparable estimation tasks.
  • The work underscores how large-system approximations can steer practical design choices without requiring exact finite-system solutions.

Load-bearing premise

The CRB-based metrics remain useful proxies for actual throughput even when no efficient receiver achieves the bound, and the large-system asymptotics accurately predict finite-system behavior.

What would settle it

If finite-system simulations with the proposed power allocation show no improvement in actual achievable rates or mutual information over uniform allocation, the claim that the asymptotic guidelines maximize the proxies would be falsified.

Figures

Figures reproduced from arXiv: 2603.17082 by Abla Kammoun, Mohamed-Slim Alouini, Xue Zhang.

Figure 1
Figure 1. Figure 1: Receiver strategies for data-symbol recovery: (i) joint [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Ijoint/(K(N − L)) versus N under different SNR levels for strategy (i) with α = β = c = 1/2. A. Accuracy assessment of the asymptotic expressions Ijoint and Iseq In the first experiment, we assess the accuracy of the derived lower bounds on the mutual information for Gaussian symbols. We fix Ptotal = 1. The block length is chose as N ∈ {16, 32, 64, 128, 256, 512, 1024, 2048}, which covers small to moderate… view at source ↗
Figure 4
Figure 4. Figure 4: NLAE versus N under different values of α and β for strategy (i) with c = 1/2 and SNR = 10 dB. and symbol estimation strategies. To evaluate the EM estimator, we generate T K(N − L) independent realizations of the received training and data signals. In each realization, the EM algorithm is applied to alternately update the channel estimate and the estimated data symbols. The estimation error is then record… view at source ↗
Figure 5
Figure 5. Figure 5: NLAE versus N under different values of α and β for strategy (ii) with c = 1/2 and SNR = 10 dB. from IEM K(N − L) = log2 (πeP) − log2 (det (πeREM)) K(N − L) . (54) On the other hand, the LMMSE estimator belongs to the family of sequential channel and symbol estimation strategies. First, the channel is estimated based on the LMMSE technique. Then, the true channel is replaced by its LMMSE estimator and the … view at source ↗
Figure 6
Figure 6. Figure 6: T versus x under Ptotal = 1 for strategy (i) with α = 3/4, c = 1/3, and SNR = 20 dB. 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 1 1.5 2 2.5 3 [PITH_FULL_IMAGE:figures/full_fig_p012_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: T versus x under Ptotal = 1 for strategy (ii) with α = 1, c = 1/2, and SNR = 20 dB. results provide several useful design insights. In particu￾lar, the proposed asymptotic framework enables system designers to quantitatively assess the tradeoff between training and data transmission power. The derived optimal power-allocation policies reveal that allocating excessive power to training is inefficient and th… view at source ↗
read the original abstract

In this work, we study the design of receivers for uplink multi-user systems, aiming to estimate both the channel and the transmitted symbols. We consider two estimation strategies: (i) a joint estimation approach, where the channel and symbols are estimated simultaneously, and (ii) a sequential estimation approach, where the channel is first estimated and then used for symbol detection. For both strategies, we derive the Cram\'er-Rao Bound (CRB) for symbol estimation to characterize fundamental performance limits. When efficient receivers achieving the CRB exist, these bounds provide accurate lower bounds on the mutual information. In general, however, such receivers may not be available, and we instead use these same CRB-based metrics as practical proxies for achievable throughput. Leveraging tools from random matrix theory (RMT), we analyze the asymptotic behavior of these lower bounds under various asymptotic regimes for both estimation strategies. This analysis enables the derivation of generic power allocation guidelines that asymptotically maximize the proxy metrics. Simulation results confirm the accuracy of the asymptotic expressions and their effectiveness in guiding resource allocation decisions.

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

Summary. The manuscript derives the Cramér-Rao Bound (CRB) for symbol estimation in joint and sequential channel-symbol estimation strategies for multi-user uplink systems. It applies random matrix theory (RMT) to obtain asymptotic expressions for these CRB-based metrics under large-system regimes, derives generic power allocation guidelines that asymptotically maximize the proxy metrics, and presents simulations to validate the asymptotics and guideline effectiveness.

Significance. If the CRB proxies are valid, the work supplies practical asymptotic guidelines for uplink resource allocation that connect estimation bounds to system design via RMT. The generic (non-fitted) nature of the guidelines and the simulation confirmation of the large-system predictions are strengths that could inform finite-system implementations.

major comments (2)
  1. [Abstract] Abstract and the section deriving the proxy metrics: the claim that CRB-based metrics serve as usable proxies for achievable throughput when efficient receivers attaining the CRB do not exist is load-bearing but insufficiently justified. The mapping from estimation variance to mutual information requires either Gaussianity plus efficiency or an explicit approximation whose error is bounded; neither is provided, so any mismatch propagates directly into the subsequent RMT optimization and the claimed allocation guidelines.
  2. [RMT asymptotic analysis] The RMT asymptotic analysis section (deriving the large-system CRB expressions): the limiting expressions must be shown to remain valid under the specific uplink multi-user channel and noise model; without an explicit statement of the required assumptions (e.g., i.i.d. entries, power scaling), it is unclear whether the derived generic power-allocation rules apply to the finite-system scenarios simulated later.
minor comments (1)
  1. [Simulation results] Simulation figures should report the number of Monte-Carlo realizations and any error-bar computation to allow readers to assess how closely the finite-system results track the RMT predictions.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments. We address each major point below with clarifications and indicate the revisions planned to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract] Abstract and the section deriving the proxy metrics: the claim that CRB-based metrics serve as usable proxies for achievable throughput when efficient receivers attaining the CRB do not exist is load-bearing but insufficiently justified. The mapping from estimation variance to mutual information requires either Gaussianity plus efficiency or an explicit approximation whose error is bounded; neither is provided, so any mismatch propagates directly into the subsequent RMT optimization and the claimed allocation guidelines.

    Authors: We agree that the justification for using CRB-based metrics as proxies requires expansion. In the revised manuscript we will add a dedicated paragraph in the proxy metrics section (and update the abstract accordingly) that explicitly invokes the Gaussian noise model to relate CRB variance to an approximate mutual-information expression of the form log(1 + P/(1 + CRB)), citing prior works that employ CRB proxies in resource allocation. We will also note the practical nature of the proxy and its validity in the large-system limit where the approximation error vanishes asymptotically, thereby supporting the subsequent RMT optimization. revision: yes

  2. Referee: [RMT asymptotic analysis] The RMT asymptotic analysis section (deriving the large-system CRB expressions): the limiting expressions must be shown to remain valid under the specific uplink multi-user channel and noise model; without an explicit statement of the required assumptions (e.g., i.i.d. entries, power scaling), it is unclear whether the derived generic power-allocation rules apply to the finite-system scenarios simulated later.

    Authors: We agree that the assumptions must be stated explicitly. The derivations rely on the standard regime N, K → ∞ with K/N → β, i.i.d. CN(0,1) channel entries, i.i.d. AWGN with variance σ², and per-user powers normalized so that total power remains O(1). In the revised version we will insert a new subsection at the beginning of the RMT analysis that lists these assumptions together with the invoked RMT theorems (e.g., Marchenko-Pastur law and related trace lemmas). This will directly confirm consistency with the simulation setup and the applicability of the derived power-allocation guidelines to the finite-system cases examined. revision: yes

Circularity Check

0 steps flagged

Standard RMT analysis of CRB expressions produces independent asymptotic guidelines

full rationale

The derivation begins with explicit CRB expressions for joint and sequential estimation, then applies standard random matrix theory tools to obtain deterministic equivalents in large-system regimes. These equivalents are maximized with respect to power allocation variables to produce the guidelines. No equation reduces to a prior fit, self-definition, or self-citation chain; the RMT step is an external analytic technique whose validity does not presuppose the final allocation rules. The proxy interpretation of CRB for throughput is stated as an assumption rather than derived from the optimization itself.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The analysis rests on standard domain assumptions from wireless communications and random matrix theory without introducing new free parameters or invented entities in the described contributions.

axioms (2)
  • domain assumption Large-system asymptotic regimes (e.g., number of antennas and users tending to infinity with fixed ratios) apply to the multi-user uplink model.
    Invoked to obtain closed-form asymptotic expressions for the CRB-based metrics.
  • domain assumption CRB serves as a valid lower bound on mutual information when efficient estimators exist and as a practical proxy otherwise.
    Stated explicitly in the abstract as the justification for using CRB-derived quantities for resource allocation.

pith-pipeline@v0.9.0 · 5486 in / 1350 out tokens · 43248 ms · 2026-05-15T09:21:17.392231+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 · 33 canonical work pages

  1. [1]

    How much training is needed in multiple-antenna wireless links?

    B. Hassibi and B. M. Hochwald, “How much training is needed in multiple-antenna wireless links?” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 951–963, 2003

    work page 2003

  2. [2]

    Training-based MIMO channel estimation: A study of estimator tradeoffs and opti- mal training signals,

    M. Biguesh and A. B. Gershman, “Training-based MIMO channel estimation: A study of estimator tradeoffs and opti- mal training signals,” IEEE transactions on signal processing, vol. 54, no. 3, pp. 884–893, 2006

    work page 2006

  3. [3]

    A new precoder design for blind channel estimation in MIMO-OFDM systems,

    S. Noh, Y. Sung, and M. D. Zoltowski, “A new precoder design for blind channel estimation in MIMO-OFDM systems,” IEEE Transactions on Wireless Communications, vol. 13, no. 12, pp. 7011–7024, 2014

    work page 2014

  4. [4]

    Semi-blind channel estimation for multiuser massive MIMO systems,

    E. Nayebi and B. D. Rao, “Semi-blind channel estimation for multiuser massive MIMO systems,” IEEE Transactions on Signal Processing, vol. 66, no. 2, pp. 540–553, 2017

    work page 2017

  5. [5]

    Semi-blind channel estimation in MIMO systems with discrete priors on data symbols,

    M. Al-Shoukairi and B. D. Rao, “Semi-blind channel estimation in MIMO systems with discrete priors on data symbols,” IEEE Signal Processing Letters, vol. 29, pp. 51–54, 2021

    work page 2021

  6. [6]

    Semi-blind signal estimation using Toeplitz structured-based subspace method,

    A. Lawal, K. Abed-Meraim, A. Zerguine, Q. Mayyala, K. N. Aliyu, and A. Muqaibel, “Semi-blind signal estimation using Toeplitz structured-based subspace method,” IEEE Wireless Communications Letters, vol. 12, no. 8, pp. 1319–1323, 2023

    work page 2023

  7. [7]

    Semi- blind channel estimation for RIS-assisted MISO systems using expectation maximization,

    C. Huang, J. Xu, W. Zhang, W. Xu, and D. W. K. Ng, “Semi- blind channel estimation for RIS-assisted MISO systems using expectation maximization,” IEEE Transactions on Vehicular Technology, vol. 71, no. 9, pp. 10 173–10 178, 2022

    work page 2022

  8. [8]

    Fast subspace-based blind and semi-blind channel estimation for MIMO-OFDM systems,

    O. Rekik, K. N. Aliyu, B. M. Tuan, K. Abed-Meraim, and N. L. Trung, “Fast subspace-based blind and semi-blind channel estimation for MIMO-OFDM systems,” IEEE Transactions on Wireless Communications, 2024, early access

    work page 2024

  9. [9]

    Channel estima- tion for multicarrier multiple input single output systems using the EM algorithm,

    C. H. Aldana, E. de Carvalho, and J. M. Cioffi, “Channel estima- tion for multicarrier multiple input single output systems using the EM algorithm,” IEEE Transactions on Signal Processing, vol. 51, no. 12, pp. 3280–3292, 2003

    work page 2003

  10. [10]

    An iterative semi-blind channel estimation scheme and uplink spec- tral efficiency of pilot contaminated one-bit massive MIMO systems,

    B. Srinivas, K. Mawatwal, D. Sen, and S. Chakrabarti, “An iterative semi-blind channel estimation scheme and uplink spec- tral efficiency of pilot contaminated one-bit massive MIMO systems,” IEEE Transactions on Vehicular Technology, vol. 68, no. 8, pp. 7854–7868, 2019. 15

    work page 2019

  11. [11]

    Joint DOD and DOA estimation of coherent targets for coprime MIMO radar,

    X. Zhang, Z. Zheng, W.-Q. Wang, and H. C. So, “Joint DOD and DOA estimation of coherent targets for coprime MIMO radar,” IEEE Transactions on Signal Processing, vol. 71, pp. 1408–1420, 2023

    work page 2023

  12. [12]

    RSS-based lo- calization techniques with large-scale experimental evaluation,

    Y. Li, B. Mukhopadhyay, and M.-S. Alouini, “RSS-based lo- calization techniques with large-scale experimental evaluation,” IEEE Transactions on Vehicular Technology, pp. 1–14, 2025

    work page 2025

  13. [13]

    RIS-based DOA estimation for communication-assisted sensing systems under hardware impairments,

    X. Zhang, N. P. Le, and M.-S. Alouini, “RIS-based DOA estimation for communication-assisted sensing systems under hardware impairments,” IEEE Open Journal of Vehicular Tech- nology, vol. 6, pp. 1736–1748, 2025

    work page 2025

  14. [14]

    Tar- get localization with unknown transmit power using rank-one semidefinite programming,

    Y. Li, J. Xu, B. Mukhopadhyay, and M.-S. Alouini, “Tar- get localization with unknown transmit power using rank-one semidefinite programming,” IEEE Wireless Communications Letters, vol. 14, no. 11, pp. 3450–3454, 2025

    work page 2025

  15. [15]

    Performance study of conditional and unconditional direction-of-arrival estimation,

    P. Stoica and A. Nehorai, “Performance study of conditional and unconditional direction-of-arrival estimation,” IEEE Trans- actions on Acoustics, Speech, and Signal Processing, vol. 38, no. 10, pp. 1783–1795, 1990

    work page 1990

  16. [16]

    Accuracy of maximum-likelihood estimates for array processing,

    U. Sandkuhler and J. Bohme, “Accuracy of maximum-likelihood estimates for array processing,” in IEEE International Con- ference on Acoustics, Speech, and Signal Processing, vol. 12. IEEE, 1987, pp. 2015–2018

    work page 1987

  17. [17]

    Cramer-rao bounds for semi- blind, blind and training sequence based channel estimation,

    E. De Carvalho and D. T. Slock, “Cramer-rao bounds for semi- blind, blind and training sequence based channel estimation,” in First IEEE signal processing workshop on signal processing advances in wireless communications, 1997, pp. 129–132

    work page 1997

  18. [18]

    Asymptotic performance of ML methods for semi-blind channel estimation,

    E. de Carvalho and D. Slock, “Asymptotic performance of ML methods for semi-blind channel estimation,” in Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No. 97CB36136), vol. 2, 1997, pp. 1624–1628

    work page 1997

  19. [19]

    Fundamental limits via CRB of semi-blind channel estimation in massive MIMO systems,

    X. Zhang, A. Kammoun, and M.-S. Alouini, “Fundamental limits via CRB of semi-blind channel estimation in massive MIMO systems,” IEEE Transactions on Signal Processing, vol. 73, pp. 3572–3587, 2025

    work page 2025

  20. [20]

    The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel,

    M. Medard, “The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel,” IEEE Transactions on Information theory, vol. 46, no. 3, pp. 933–946, 2000

    work page 2000

  21. [21]

    Achievable rate of MIMO channels with data-aided channel estimation and perfect inter- leaving,

    J. Baltersee, G. Fock, and H. Meyr, “Achievable rate of MIMO channels with data-aided channel estimation and perfect inter- leaving,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 12, pp. 2358–2368, 2001

    work page 2001

  22. [22]

    Capacity of fading MIMO channels with channel estimation error,

    T. Yoo and A. Goldsmith, “Capacity of fading MIMO channels with channel estimation error,” in IEEE International Confer- ence on Communications, vol. 2. IEEE, 2004, pp. 808–813

    work page 2004

  23. [23]

    Fading channels: How perfect need ’perfect side information’ be?

    A. Lapidoth and S. Shamai, “Fading channels: How perfect need ’perfect side information’ be?” IEEE Transactions on Information Theory, vol. 48, no. 5, pp. 1118–1134, 2002

    work page 2002

  24. [24]

    On the effect of receiver estimation error upon channel mutual information,

    A. Vosoughi and A. Scaglione, “On the effect of receiver estimation error upon channel mutual information,” IEEE Transactions on Signal Processing, vol. 54, no. 2, pp. 459–472, 2006

    work page 2006

  25. [25]

    Op- timal design of energy-efficient multi-user MIMO systems: Is massive MIMO the answer?

    E. Björnson, L. Sanguinetti, J. Hoydis, and M. Debbah, “Op- timal design of energy-efficient multi-user MIMO systems: Is massive MIMO the answer?” IEEE Transactions on Wireless Communications, vol. 14, no. 6, pp. 3059–3075, 2015

    work page 2015

  26. [26]

    S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory. Upper Saddle River, NJ: Prentice Hall, 1993, vol. 1, ch. 3 and 10, 1993

    work page 1993

  27. [27]

    Kailath, A

    T. Kailath, A. H. Sayed, and B. Hassibi, Linear estimation. Upper Saddle River, NJ: Prentice-Hall, 2000

    work page 2000

  28. [28]

    Mobile propagation loss with a low base station antenna for NLOS street microcells in urban area,

    A. Tang, J. Sun, and K. Gong, “Mobile propagation loss with a low base station antenna for NLOS street microcells in urban area,” in IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No. 01CH37202), vol. 1. IEEE, 2001, pp. 333–336

    work page 2001

  29. [29]

    Distribution of eigenvalues for some sets of random matrices,

    V. A. Marchenko and L. A. Pastur, “Distribution of eigenvalues for some sets of random matrices,” Matematicheskii Sbornik, vol. 114, no. 4, pp. 507–536, 1967

    work page 1967

  30. [30]

    Random matrix theory and wireless communications,

    A. M. Tulino, S. Verdú et al., “Random matrix theory and wireless communications,” Foundations and Trends® in Com- munications and Information Theory, vol. 1, no. 1, pp. 1–182, 2004

    work page 2004

  31. [31]

    Z. D. Bai and J. W. Silverstein, Spectral Analysis of Large Dimensional Random Matrices, 2nd ed., ser. Springer Series in Statistics. New York, NY: Springer, 2010

    work page 2010

  32. [32]

    On bilinear forms based on the resolvent of large random matrices,

    W. Hachem, P. Loubaton, J. Najim, and P. Vallet, “On bilinear forms based on the resolvent of large random matrices,” in Annales de l’IHP Probabilités et statistiques, vol. 49, no. 1, 2013, pp. 36–63

    work page 2013

  33. [33]

    Per- formance of mutual information inference methods under un- known interference,

    A. Kammoun, R. Couillet, J. Najim, and M. Debbah, “Per- formance of mutual information inference methods under un- known interference,” IEEE Transactions on Information The- ory, vol. 59, no. 2, pp. 1129–1148, 2013

    work page 2013