Search arXivSearch

arXiv · 1201.0426

Phase-Only Analog Encoding for a Multi-Antenna Fusion Center

Abstract

We consider a distributed sensor network in which the single antenna sensor nodes observe a deterministic unknown parameter and after encoding the observed signal with a phase parameter, the sensor nodes transmit it simultaneously to a multi-antenna fusion center (FC). The FC optimizes the phase encoding parameter and feeds it back to the sensor nodes such that the variance of estimation error can be minimized. We relax the phase optimization problem to a semidefinite programming problem and the numerical results show that the performance of the proposed method is close to the theoretical bound. Also, asymptotic results show that when the number of sensors is very large and the variance of the distance between the sensor nodes and FC is small, multiple antennas do not provide a benefit compared with a single antenna system; when the number of antennas $M$ is large and the measurement noise at the sensor nodes is small compared with the additive noise at the FC, the estimation error variance can be reduced by a factor of $M$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feng Jiang, Jie Chen, A. Lee Swindlehurst. 2012-01-02. Phase-Only Analog Encoding for a Multi-Antenna Fusion Center. https://arxiv.org/abs/1201.0426

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