arxiv: 2604.20643 · v1 · submitted 2026-04-22 · 💻 cs.IT · math.IT

Recognition: unknown

Minimum Energy per Bit of Unsourced Multiple Access with Location-Based Codebook Partitioning

Deekshith Pathayappilly Krishnan , Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi

Authors on Pith no claims yet

Pith reviewed 2026-05-09 22:51 UTC · model grok-4.3

classification 💻 cs.IT math.IT

keywords unsourced multiple accessenergy per bitpath losscodebook partitioningfinite blocklengthGaussian channelreplica method

0 comments

The pith

Location-based codebook partitioning lowers the minimum energy per bit for unsourced multiple access when path losses differ across users.

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

The paper derives finite-blocklength bounds on the minimum achievable energy per bit for a Gaussian unsourced multiple access channel under heterogeneous path-loss conditions. It examines a strategy in which users know their own path losses and therefore assign themselves to distinct codebooks rather than sharing one common codebook. Numerical simulations together with a large-system analysis based on the replica method are used to measure the resulting energy savings. A sympathetic reader would care because unsourced multiple access is intended for large numbers of uncoordinated devices, and energy per bit directly limits battery life and coverage in such deployments.

Core claim

When path loss is known to the transmitters, location-based codebook partitioning yields a strictly lower minimum energy per bit than the conventional unsourced multiple access scheme that forces every user to employ the identical codebook; the improvement is established by finite-blocklength bounds, confirmed by direct simulation, and corroborated by replica-method analysis in the large-system limit.

What carries the argument

Location-based codebook partitioning, which maps each user to a codebook chosen according to its known path loss so that stronger users do not waste energy on codes sized for weaker users.

If this is right

The minimum energy per bit decreases as the spread of path losses across the user population grows.
Finite-blocklength bounds become tighter when codebooks are matched to individual path losses.
The replica-method large-system limit reproduces the finite-blocklength gains observed in simulation.
The conventional common-codebook approach is provably suboptimal once path-loss information is available at the transmitters.

Where Pith is reading between the lines

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

If path-loss estimates can be obtained at low overhead, the same partitioning idea could be applied in other uncoordinated multiple-access settings to trade channel knowledge for energy.
The gain is largest when path losses vary most, suggesting that dense deployments with users at very different distances benefit most from location-aware codebook design.
Because the analysis covers both finite and asymptotic blocklengths, the results supply concrete design guidelines for choosing codebook sizes once path-loss statistics are known.

Load-bearing premise

Each user knows its own path loss in advance and can therefore select the matching codebook.

What would settle it

A direct numerical comparison in which all users are forced to use the same codebook despite known heterogeneous path losses would produce the same or higher minimum energy per bit than the partitioned case.

Figures

Figures reproduced from arXiv: 2604.20643 by Deekshith Pathayappilly Krishnan, Giuseppe Durisi, Kaan Okumus, Khac-Hoang Ngo.

read the original abstract

We derive finite-blocklength bounds on the minimum achievable energy per bit over a Gaussian unsourced multiple access (UMA) channel in the presence of heterogeneous path-loss conditions. We consider a setting in which the path loss is known to the users, which enables the use of location-based codebook partitioning [\c{C}akmak et al., 2025]. Through numerical simulations and a large-system analysis based on the replica method, we quantify the performance gain of this strategy relative to the conventional UMA approach in which all users employ a common codebook.

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.

Desk Editor's Note private letter to a colleague

The paper derives finite-blocklength bounds and replica-based large-system results showing energy-per-bit gains from location-based codebook partitioning in heterogeneous-path-loss UMA, but the gains rest on perfect path-loss knowledge with no robustness checks.

read the letter

The core contribution here is applying location-based codebook partitioning to the finite-blocklength unsourced multiple-access setting with varying path losses. The authors derive bounds on minimum energy per bit and back them with simulations plus replica-method analysis to compare against the usual common-codebook baseline. That combination is new relative to the cited 2025 partitioning paper and standard UMA work, and the numerical quantification of the gain is the part that could interest protocol designers working on energy-limited access scenarios. The derivations appear to follow established finite-blocklength techniques without obvious circularity or invented parameters. The replica analysis is used in the usual way for large-system limits, which is fine as long as the assumptions are stated clearly. The main limitation is the model assumption that path loss is known perfectly at the users so partitioning works without error. The stress-test note is right that nothing in the abstract or described results tests mismatched partitioning or estimation noise; even modest errors would change overlap and interference, so the reported gains would shrink. That is a real but contained gap rather than a fatal flaw in the derivations themselves. The paper is aimed at information theorists and wireless researchers focused on unsourced access and finite-blocklength analysis. Specialists in that niche would get value from the bounds and the concrete comparison, while broader readers might find the setting too specific. It is worth sending to peer review because the new bounds and analysis are grounded enough to merit referee input, even if the authors should add a short robustness section on imperfect path-loss knowledge.

Referee Report

3 major / 2 minor

Summary. The paper derives finite-blocklength bounds on the minimum achievable energy per bit over a Gaussian unsourced multiple access (UMA) channel with heterogeneous path-loss conditions. Assuming path loss is known to the users, it introduces location-based codebook partitioning and quantifies the resulting performance gains relative to the conventional common-codebook UMA approach through numerical simulations and a large-system replica-method analysis.

Significance. If the bounds and quantified gains hold, the work provides a useful extension of UMA information-theoretic analysis to practical heterogeneous settings, highlighting potential energy-efficiency benefits from location-aware partitioning. The combination of finite-blocklength bounds, replica analysis, and simulations offers a multi-scale assessment that strengthens the contribution if the underlying assumptions are validated.

major comments (3)

[Model and Assumptions] The model assumes perfect per-user path-loss knowledge to enable error-free codebook partitioning (as stated in the abstract and model description). No derivation, bound, or simulation addresses the mismatched case with estimation errors, which would alter overlap statistics and interference; this directly impacts the central claim of performance gains and requires at least a sensitivity analysis or robust bound.
[Large-System Analysis] The replica-method large-system analysis is invoked to characterize asymptotic behavior, but the paper does not explicitly verify the replica-symmetry assumption or state the conditions under which it holds for the heterogeneous path-loss Gaussian UMA channel; without this, the quantified gains in the large-system limit rest on unconfirmed technical premises.
[Finite-Blocklength Bounds] The finite-blocklength bounds are presented as derived, yet the manuscript provides neither the full proof steps nor explicit handling of error bars or approximation tightness; this weakens the support for the numerical comparisons to the common-codebook baseline.

minor comments (2)

[Abstract] The abstract could specify the magnitude of the reported gains (e.g., dB improvement or percentage) rather than stating only that they are quantified.
[References and Simulations] Ensure all citations, including Çakmak et al. 2025, are fully formatted and that any simulation parameters (blocklength, number of users, path-loss distribution) are tabulated for reproducibility.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. We address each major comment in turn below, indicating the revisions we plan to incorporate.

read point-by-point responses

Referee: [Model and Assumptions] The model assumes perfect per-user path-loss knowledge to enable error-free codebook partitioning (as stated in the abstract and model description). No derivation, bound, or simulation addresses the mismatched case with estimation errors, which would alter overlap statistics and interference; this directly impacts the central claim of performance gains and requires at least a sensitivity analysis or robust bound.

Authors: The manuscript focuses on the ideal setting with perfect path-loss knowledge at the users, as this enables the location-based partitioning and allows us to quantify the maximum achievable gains relative to the common-codebook baseline. We agree that path-loss estimation errors represent an important practical consideration that could affect overlap and interference statistics. In the revised version, we will add a sensitivity analysis that models small estimation errors and evaluates their impact on the minimum energy per bit via additional simulations. revision: yes
Referee: [Large-System Analysis] The replica-method large-system analysis is invoked to characterize asymptotic behavior, but the paper does not explicitly verify the replica-symmetry assumption or state the conditions under which it holds for the heterogeneous path-loss Gaussian UMA channel; without this, the quantified gains in the large-system limit rest on unconfirmed technical premises.

Authors: The large-system analysis applies the replica method under the standard replica-symmetric ansatz, which is widely used for Gaussian multiple-access channels with random coding. We will revise the manuscript to explicitly state the replica-symmetry assumption and briefly discuss the conditions under which it is expected to hold for the heterogeneous path-loss model, citing relevant results from the replica-analysis literature on multiuser Gaussian channels. revision: yes
Referee: [Finite-Blocklength Bounds] The finite-blocklength bounds are presented as derived, yet the manuscript provides neither the full proof steps nor explicit handling of error bars or approximation tightness; this weakens the support for the numerical comparisons to the common-codebook baseline.

Authors: The finite-blocklength bounds are derived using standard techniques, with the complete proof steps provided in the appendix. To improve accessibility, we will add a high-level outline of the derivation in the main text and include a discussion of bound tightness, supported by comparisons to Monte Carlo simulations. We will also report error bars from the numerical evaluations to strengthen the comparisons with the common-codebook approach. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper derives finite-blocklength bounds on minimum energy per bit for the Gaussian UMA channel under heterogeneous path loss using standard information-theoretic techniques and replica-method large-system analysis. Location-based codebook partitioning is introduced as an explicit modeling choice enabled by the stated assumption that path loss is known to the users; this assumption is not derived from the bounds or gains themselves. No equations reduce to inputs by construction, no fitted parameters are relabeled as predictions, and the cited Çakmak et al. (2025) reference does not overlap with the present authors or serve as a load-bearing self-justification. The performance comparison to the common-codebook baseline is performed under the given model without tautological reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 3 axioms · 0 invented entities

The central claim rests on standard domain assumptions in information theory and wireless communications; no new entities are postulated and no free parameters are explicitly fitted in the abstract.

axioms (3)

domain assumption Users know their individual path loss
Explicitly stated as the condition that enables location-based partitioning
domain assumption Gaussian noise model for the UMA channel
Standard modeling choice for the underlying channel
domain assumption Replica method yields accurate large-system characterization
Invoked for the asymptotic analysis without further justification in the abstract

pith-pipeline@v0.9.0 · 5400 in / 1358 out tokens · 54667 ms · 2026-05-09T22:51:32.780027+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

16 extracted references

[1]

Wireless 6G connectivity for massive number of devices and critical services,

A. E. Kalor, G. Durisi, S. Coleri, S. Parkvall, W. Yu, A. Mueller, and P. Popovski, “Wireless 6G connectivity for massive number of devices and critical services,”Proc. IEEE, Nov. 2024

2024
[2]

A perspective on massive random-access,

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

2017
[3]

Unsourced multiple access with random user activity,

K.-H. Ngo, A. Lancho, G. Durisi, and A. Graell i Amat, “Unsourced multiple access with random user activity,”IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4537–4558, Jul. 2023

2023
[4]

Energy efficient coded random access for the wireless uplink,

S. S. Kowshik, K. Andreev, A. Frolov, and Y . Polyanskiy, “Energy efficient coded random access for the wireless uplink,”IEEE Trans. Commun., vol. 68, no. 8, pp. 4694–4708, Jun. 2020

2020
[5]

Unsourced random access,

K. Andreev, P. Rybin, and A. Frolov, “Unsourced random access,” Foundations and Trends® in Commun. and Inf. Theory, vol. 22, no. 5-6, pp. 605–842, Aug. 2025

2025
[6]

SPARCs for unsourced random access,

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

2021
[7]

A coupled compressive sensing scheme for unsourced multiple access,

V . K. Amalladinne, A. Vem, D. K. Soma, K. R. Narayanan, and J. Chamberland, “A coupled compressive sensing scheme for unsourced multiple access,” inProc. IEEE Int. Conf. Acoustics, Speech and Signal Proc. (ICASSP), Calgary, AB, Canada, Apr. 2018, pp. 6628–6632

2018
[8]

A coded compressed sensing scheme for unsourced multiple access,

V . K. Amalladinne, J. F. Chamberland, and K. R. Narayanan, “A coded compressed sensing scheme for unsourced multiple access,”IEEE Trans. Inf. Theory, vol. 66, no. 10, pp. 6509–6533, Oct. 2020

2020
[9]

Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation,

V . K. Amalladinne, A. K. Pradhan, C. Rush, J.-F. Chamberland, and K. R. Narayanan, “Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation,”IEEE Trans. Inf. Theory, vol. 68, no. 4, pp. 2384–2409, Apr. 2022

2022
[10]

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 Trans. Inf. Theory, vol. 71, no. 5, pp. 3614–3643, May 2025

2025
[11]

Theory of spin glasses,

S. F. Edwards and P. W. Anderson, “Theory of spin glasses,”Journal of Physics F: Metal Physics, vol. 5, no. 5, p. 965, May 1975

1975
[12]

Minimum energy per bit of unsourced multiple access with location-based codebook partitioning (extended version),

D. P. Krishnan, K. Okumus, K.-H. Ngo, and G. Durisi, “Minimum energy per bit of unsourced multiple access with location-based codebook partitioning (extended version),” 2026. [Online]. Available: https://gdurisi.github.io/files/2026/krishnan06-02a.pdf

2026
[13]

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 Trans. Inf. Theory, vol. 48, no. 11, pp. 2888–2910, Nov. 2002

2002
[14]

Randomly spread CDMA: Asymptotics via statistical physics,

D. Guo and S. Verdú, “Randomly spread CDMA: Asymptotics via statistical physics,”IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1983– 2010, Jun. 2005

1983
[15]

Performance of synchronous multirate CDMA via statistical physics,

D. Guo, “Performance of synchronous multirate CDMA via statistical physics,” inProc. Int. Symp. Inf. Theory (ISIT), Adelaide, SA, Australia, Sept. 2005, pp. 199–203

2005
[16]

Remarks on massive random access,

Y . Polyanskiy, “Remarks on massive random access,” 2020, DLR–MIT– TUM Workshop, Munich, Germany, Feb. 2020

2020