Search arXivSearch

arXiv · 1311.1187

Constrained Codes for Joint Energy and Information Transfer

Abstract

In various wireless systems, such as sensor RFID networks and body area networks with implantable devices, the transmitted signals are simultaneously used both for information transmission and for energy transfer. In order to satisfy the conflicting requirements on information and energy transfer, this paper proposes the use of constrained run-length limited (RLL) codes in lieu of conventional unconstrained (i.e., random-like) capacity-achieving codes. The receiver's energy utilization requirements are modeled stochastically, and constraints are imposed on the probabilities of battery underflow and overflow at the receiver. It is demonstrated that the codewords' structure afforded by the use of constrained codes enables the transmission strategy to be better adjusted to the receiver's energy utilization pattern, as compared to classical unstructured codes. As a result, constrained codes allow a wider range of trade-offs between the rate of information transmission and the performance of energy transfer to be achieved.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ali Mohammad Fouladgar, Osvaldo Simeone, Elza Erkip. 2013-11-06. Constrained Codes for Joint Energy and Information Transfer. https://doi.org/10.1109/tcomm.2014.2317480

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