Search arXivSearch

arXiv · 2603.01749

Type-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization

Abstract

We consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced multiple access, type-based unsourced multiple access (TUMA) aims to estimate the type, i.e., the empirical distribution of transmitted messages. We extend our prior work on TUMA over additive white Gaussian channels to fading scenarios in which neither the transmitters nor the receiver have channel state information. To mitigate the impact of path-loss variability, we employ location-based codebook partitioning: users with similar large-scale fading coefficients use the same codebook. The decoder is built on the multisource approximate message passing algorithm proposed by Cakmak et al. (2025), and supports both centralized and distributed implementations. As an application, we demonstrate how TUMA enables efficient communication in a multi-target localization setting, where distributed sensors report to a D-MIMO receiver quantized target positions. We propose a performance cost function that combines localization errors with a misdetection penalty, and use it to characterize how performance depends on the fraction of resources assigned to sensing vs. communication, as well as on the number of bits used to quantize the positions of the targets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaan Okumus, Khac-Hoang Ngo, Giuseppe Durisi, Erik G. Ström. 2026-08-17. Type-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization. https://arxiv.org/abs/2603.01749

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

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT