Search arXivSearch

arXiv · 2201.00249

The Channel Capacity of General Complex-Valued Load Modulation for Backscatter Communication

Abstract

This paper studies achievable information rates of backscatter communication systems where the tag performs load modulation with a freely adaptable passive termination. We find that the complex phasor of the tag current is constrained to a disk and that the capacity problem can therefore be described with existing results on peak-power-limited quadrature channels. This allows us to state the channel capacity and the capacity-achieving distribution of the load impedance, which is described by non-concentric circles in the right half-plane. For the low-SNR case (SNR < 4.8 dB) we find that channel capacity is achieved by a purely reactive load with Cauchy-distributed reactance. The exposition is based on a system model that abstracts all relevant classes of backscatter communication systems, including RFID. To address practicality, we construct a symbol alphabet that allows for a near-capacity information rate of more than 6 bit per load-switching period at reasonably high SNR. We also find that the rate hardly decreases when typical value-range constraints are imposed on the load impedance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gregor Dumphart, Johannes Sager, Armin Wittneben. 2022-01-14. The Channel Capacity of General Complex-Valued Load Modulation for Backscatter Communication. https://doi.org/10.1109/wcnc51071.2022.9771646

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