Search arXivSearch

arXiv · 1611.00312

Detection of Single vs Multiple Antenna Transmission Systems Using Pilot Data

Abstract

In this paper, we consider the problem of classifying the transmission system when it is not known a priori whether the transmission is via a single antenna or multiple antennas. The receiver is assumed to be employed with a known number of antennas. In a data frame transmitted by most multiple input multiple output (MIMO) systems, some pilot or training data is inserted for symbol timing synchronization and estimation of the channel. Our goal is to perform MIMO transmit antenna classification using this pilot data. More specifically, the problem of determining the transmission system is cast as a multiple hypothesis testing problem where the number of hypotheses is equal to the maximum number of transmit antennas. Under the assumption of receiver having the exact knowledge of pilot data used for timing synchronization and channel estimation, we consider maximum likelihood (ML) and correlation test statistics to classify the MIMO transmit system. When only probabilistic knowledge of pilot data is available at the receiver, a hybrid-maximum likelihood (HML) based test statistic is constructed using the expectation-maximization (EM) algorithm. The performance of the proposed algorithms is illustrated via simulations and comparative merits of different techniques in terms of the computational complexity and performance are discussed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thakshila Wimalajeewa, Pramod K Varshney, Wei Su. 2016-08-09. Detection of Single vs Multiple Antenna Transmission Systems Using Pilot Data. https://arxiv.org/abs/1611.00312

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