Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.21812

Generalized Two-Dimensional Index Modulation in the Code-Spatial Domain for LPWAN

Long Yuan·Wenkun Wen·Junlin Liu·Peiran Wu·Minghua Xia
View original source ↗Read source document ↗Export metadata ↓

Abstract

Low-power wide-area networks (LPWANs) are crucial for large-scale Internet of Things (IoT) applications, yet they face increasing demands for higher data rates, improved reliability, and enhanced energy efficiency under stringent hardware constraints. To address these challenges, this paper introduces a generalized code-index modulation (CIM) transceiver that employs multiple-antenna index modulation (IM). The transmitter integrates spatial modulation (SM), space-time block coding (STBC), and CIM into a unified two-dimensional (2D) coding structure, where the spreading sequences -- realized via continuous phase modulation with spread spectrum (CPM-SS), chirp spread spectrum, or Zadoff-Chu sequences -- serve as spreading codes. Three specific schemes are proposed: SM-CIM, STBC-SM-CIM, and an enhanced STBC-SM-CIM (ESTBC-SM-CIM), designed to jointly improve data rate and energy efficiency. Closed-form expressions for the average bit error probability are derived, and system performance is analyzed in terms of data rate, energy efficiency, and computational complexity. Simulation results show that the proposed designs consistently outperform benchmark schemes, demonstrating their potential for enabling high-data-rate, energy-efficient LPWAN and IoT communications.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Long Yuan, Wenkun Wen, Junlin Liu, Peiran Wu, Minghua Xia. 2026-04-23. Generalized Two-Dimensional Index Modulation in the Code-Spatial Domain for LPWAN. https://arxiv.org/abs/2604.21812

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗