Search arXivSearch

arXiv · 1811.05637

On the Capacity of MISO Channels with One-Bit ADCs and DACs

Abstract

A one-bit wireless transceiver is a promising communication architecture that not only can facilitate the design of mmWave communication systems but also can extremely diminish power consumption. The non-linear distortion effects by one-bit quantization at the transceiver, however, change the fundamental limits of communication rates. In this paper, the capacity of a multiple-input single-output (MISO) fading channel with one-bit transceiver is characterized in a closed form when perfect channel state information (CSI) is available at both a transmitter and a receiver. One major finding is that the capacity achieving transmission strategy is to uniformly use four multi-dimensional constellation points. The four multi-dimensional constellation points are optimally chosen as a function of the channel and the signal-to-noise ratio (SNR) among the channel input set constructed by a spatial lattice modulation method. As a byproduct, it is shown that a few-bit CSI feedback suffices to achieve the capacity. For the case when CSI is not perfectly known to the receiver, practical channel training and CSI feedback methods are presented, which effectively exploit the derived capacity-achieving transmission strategy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunseo Nam, Heedong Do, Yo-Seb Jeon, Namyoon Lee. 2018-11-14. On the Capacity of MISO Channels with One-Bit ADCs and DACs. https://arxiv.org/abs/1811.05637

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