35 research outputs found
A Coupled Compressive Sensing Scheme for Unsourced Multiple Access
This article introduces a novel paradigm for the unsourced multiple-access
communication problem. This divide-and-conquer approach leverages recent
advances in compressive sensing and forward error correction to produce a
computationally efficient algorithm. Within the proposed framework, every
active device first partitions its data into several sub-blocks, and
subsequently adds redundancy using a systematic linear block code. Compressive
sensing techniques are then employed to recover sub-blocks, and the original
messages are obtained by connecting pieces together using a low-complexity
tree-based algorithm. Numerical results suggest that the proposed scheme
outperforms other existing practical coding schemes. Measured performance lies
approximately ~dB away from the Polyanskiy achievability limit, which is
obtained in the absence of complexity constraints
Massive Random Access with Common Alarm Messages
The established view on massive IoT access is that the IoT devices are
activated randomly and independently. This is a basic premise also in the
recent information-theoretic treatment of massive access by Polyanskiy. In a
number of practical scenarios, the information from IoT devices in a given
geographical area is inherently correlated due to a commonly observed physical
phenomenon. We introduce a model for massive access that accounts for
correlation both in device activation and in the message content. To this end,
we introduce common alarm messages for all devices. A physical phenomenon can
trigger an alarm causing a subset of devices to transmit the same message at
the same time. We develop a new error probability model that includes false
positive errors, resulting from decoding a non-transmitted codeword. The
results show that the correlation allows for high reliability at the expense of
spectral efficiency. This reflects the intuitive trade-off: an access from a
massive number can be ultra-reliable only if the information across the devices
is correlated.Comment: Extended version of conference submissio
Energy Efficiency of Unsourced Random Access over the Binary-Input Gaussian Channel
We investigate the fundamental limits of the unsourced random access over the
binary-input Gaussian channel. By fundamental limits, we mean the minimal
energy per bit required to achieve the target per-user probability of error.
The original method proposed by Y. Polyanskiy (2017) and based on Gallager's
trick does not work well for binary signaling. We utilize Fano's method, which
is based on the choice of the so-called ``good'' region. We apply this method
for the cases of Gaussian and binary codebooks and obtain two achievability
bounds. The first bound is very close to Polyanskiy's bound but does not lead
to any improvement. At the same time, the numerical results show that the bound
for the binary case practically coincides with the bound for the Gaussian
codebook. Thus, we conclude that binary modulation does not lead to performance
degradation, and energy-efficient schemes with binary modulation do exist.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
Capacity per Unit-Energy of Gaussian Random Many-Access Channels
We consider a Gaussian multiple-access channel with random user activity
where the total number of users and the average number of active users
may be unbounded. For this channel, we characterize the maximum number of
bits that can be transmitted reliably per unit-energy in terms of and
. We show that if is sublinear in , then each user can
achieve the single-user capacity per unit-energy. Conversely, if is superlinear in , then the capacity per unit-energy is zero. We
further demonstrate that orthogonal-access schemes, which are optimal when all
users are active with probability one, can be strictly suboptimal.Comment: Presented in part at the IEEE International Symposium on Information
Theory (ISIT) 202