Search arXivSearch

arXiv · 2607.08777

SIDMA: Semantic Interleave Division Multiple Access Communication System

Abstract

Multiple Access (MA) technology has consistently served as the core driving force behind the evolution of mobile communications. As a promising paradigm for next-generation communications, Semantic Communication explores entirely new semantic spatial resources by mining the deep meaning of information. However, the inherent spatial correlation and importance heterogeneity of semantic features often cause semantic collisions and semantic collapse in multi-user concurrent transmission scenarios. To address these challenges, this paper proposes a Semantic Interleaved Division Multiple Access (SIDMA) technique. By utilizing a permutation operator to perform structural whitening on semantic features and combining it with an Importance-aware Power Allocation (ImpPA) module for differentiated protection, SIDMA scatters core features across the interleaving domain and adaptively optimizes power levels based on real-time channel conditions. Simulation results demonstrate that, compared with traditional MA techniques and advanced semantic multiple access schemes including Orthogonal-Model Division Multiple Access (OMDMA), Deep Multiple Access (DeepMA), and Shared Embedding (SE), the proposed SIDMA exhibits superior reconstruction fidelity and scalability in multi-user concurrent transmissions, effectively enhancing the communication quality and robustness in resource-constrained environments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunlu Wang, Chen Dong, Sen Wang, Lei Teng, Yaping Sun, Xiaodong Xu, Ping Zhang. 2026-05-27. SIDMA: Semantic Interleave Division Multiple Access Communication System. https://arxiv.org/abs/2607.08777

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