Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.00236

An Approach to Asynchronous Unsourced Random Access

Alireza Karami·Dmitry Trukhachev
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work we propose an approach to construct a fully asynchronous unsourced random access communications (URA) system. Besides the common URA features such as the absence of the user identification information in the packet and the decoding oriented to receiving the content of the messages, there is no limitation on the user transmission timing. The active users can transmit their packet any time on demand. The proposed system belongs to the class of preamble-payload URA formats. Contrary to the typical role of the preamble to serve as a temporary user identification, the preamble serves for the purpose of timing acquisition. The proposed system also employs a very small pool of preambles to resolve collisions of packets transmitted simultaneously.We provide a performance analysis and simulation results for the proposed system and demonstrate that for a wide range of signal-to-noise ratios (SNR)s the supported numbers of active users are close to the numbers of users supported by a slotted URA system counterpart.

Explore related subjects

cs.ITmath.IT

Keep this discovery

BibTeXRIS

Alireza Karami, Dmitry Trukhachev. 2026-08-31. An Approach to Asynchronous Unsourced Random Access. https://arxiv.org/abs/2609.00236

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.IT subjectmath.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2005

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR↗
arXiv2025

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG↗
arXiv2026

Geometric mean and Lebesgue-type decomposition of completely positive maps

We introduce the geometric mean and the parallel sum of completely positive (CP) maps between von Neumann algebras, based on the Pusz--Woronowicz theory of positive sesquilinear forms. We provide a concrete characterization via a block matrix positivity condition and establish their fundamental properties, including the AM--GM--HM inequality with respect to the CP order. In finite-dimensional settings, our construction is compatible with the Choi--Jamiolkowski correspondence, under which the geometric mean of CP maps corresponds to the Kubo--Ando geometric mean of their Choi matrices. This yields a natural operator-theoretic framework for interpolating quantum channels. As an application, we obtain index-type inequalities for conditional expectations in subfactor theory. Finally, we establish a Lebesgue-type decomposition of CP maps via a parallel sum construction, thereby providing a unified framework that simultaneously generalizes Ando's decomposition of bounded positive operators and Kosaki's decomposition of normal positive functionals on von Neumann algebras.

math.OA↗