Search arXivSearch

arXiv · 1601.08062

Performance Analysis for Pilot-based 1-bit Channel Estimation with Unknown Quantization Threshold

Abstract

Parameter estimation using quantized observations is of importance in many practical applications. Under a symmetric $1$-bit setup, consisting of a zero-threshold hard-limiter, it is well known that the large sample performance loss for low signal-to-noise ratios (SNRs) is moderate ($\frac{2}π$ or $-1.96$dB). This makes low-complexity analog-to-digital converters (ADCs) with $1$-bit resolution a promising solution for future wireless communications and signal processing devices. However, hardware imperfections and external effects introduce the quantizer with an unknown hard-limiting level different from zero. In this paper, the performance loss associated with pilot-based channel estimation, subject to an asymmetric hard limiter with unknown offset, is studied under two setups. The analysis is carried out via the Cramér-Rao lower bound (CRLB) and an expected CRLB for a setup with random parameter. Our findings show that the unknown threshold leads to an additional information loss, which vanishes for low SNR values or when the offset is close to zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Stein, Shahar Bar, Josef A. Nossek, Joseph Tabrikian. 2016-01-29. Performance Analysis for Pilot-based 1-bit Channel Estimation with Unknown Quantization Threshold. https://doi.org/10.1109/icassp.2016.7472499

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