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

2026-04-22

AI Summary

This work addresses the degradation in energy efficiency per bit caused by heterogeneous path losses in Gaussian unsourced multiple access channels. To mitigate this issue, the authors propose a location-aware codebook partitioning strategy that leverages users’ known path loss information to enable differentiated codebook design. Through finite blocklength bound analysis and large-system asymptotics derived via the replica method, the study theoretically demonstrates that the proposed scheme significantly outperforms conventional common-codebook approaches. Numerical results further confirm that, under the same reliability constraints, the method substantially reduces the minimum achievable energy per bit, thereby enhancing overall energy efficiency.

Technology Category

• Machine Learning: Hardware-aware ML
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Sampling/Simulation-based Search

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Energy management for devices in mobile Web and WoT environments
• User Modeling, Personalization and Recommendation: On-Device user modeling, personalization, and recommendation
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

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 [Ç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.

Problem

• unsourced multiple access
• minimum energy per bit
• heterogeneous path loss
• codebook partitioning
• finite-blocklength

Innovation

• unsourced multiple access
• location-based codebook partitioning
• minimum energy per bit
• heterogeneous path loss
• replica method