Search arXivSearch

arXiv · 2606.04537

Enhanced Fluid Index Modulation for Integrated Data and Energy Transfer

Abstract

Integrated data and energy transfer (IDET) is a promising technique for supporting sustainable low-power wireless networks. To improve both communication reliability and energy transfer efficiency, this paper investigates a fluid index modulation (FIM) assisted IDET system, where the base station employs a two-dimensional fluid antenna system (FAS) and the receiver adopts a power-splitting architecture. In FIM, the information bits are delivered not only from the modulation symbols, but also the index of antenna position. Under finite-alphabet signaling, the average harvested power, bit error rate (BER), and achievable data rate are derived in closed form. A joint optimization problem is formulated to maximize the average harvested power subject to BER and achievable rate constraints by jointly optimizing the port selection, precoding vector, and power splitting ratio. An alternating optimization framework is developed, where the precoding vector and port selection are obtained via a Riemannian augmented Lagrangian method (RALM) and block coordinate descent (BCD) algorithm, respectively. Simulation results demonstrate that the proposed scheme achieves a superior rate-energy trade-off over benchmark schemes, while the proposed algorithm attains near-optimal performance with significantly lower complexity than exhaustive search.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Long Zhang, Yizhe Zhao, Halvin Yang, Qiang Liu, Kai-Kit Wong. 2026-06-03. Enhanced Fluid Index Modulation for Integrated Data and Energy Transfer. https://arxiv.org/abs/2606.04537

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