Search arXivSearch

arXiv · 0905.4303

On Block Noncoherent Communication with Low-Precision Phase Quantization at the Receiver

Abstract

We consider communication over the block noncoherent AWGN channel with low-precision Analog-to-Digital Converters (ADCs) at the receiver. For standard uniform Phase Shift Keying (PSK) modulation, we investigate the performance of a receiver architecture that quantizes only the phase of the received signal; this has the advantage of being implementable without automatic gain control, using multiple 1-bit ADCs preceded by analog multipliers. We study the structure of the transition density of the resulting channel model. Several results, based on the symmetry inherent in the channel, are provided to characterize this transition density. A low complexity procedure for computing the channel capacity is obtained using these results. Numerical capacity computations for QPSK show that 8-bin phase quantization of the received signal recovers more than 80-85 % of the capacity attained with unquantized observations, while 12-bin phase quantization recovers above 90-95 % of the unquantized capacity. Dithering the constellation is shown to improve the performance in the face of drastic quantization.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaspreet Singh, Upamanyu Madhow. 2009-05-26. On Block Noncoherent Communication with Low-Precision Phase Quantization at the Receiver. https://arxiv.org/abs/0905.4303

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