Search arXivSearch

arXiv · 1802.10259

Spectral Efficiency of Mixed-ADC Massive MIMO

Abstract

We study the spectral efficiency (SE) of a mixed-ADC massive MIMO system in which K single-antenna users communicate with a base station (BS) equipped with M antennas connected to N high-resolution ADCs and M-N one-bit ADCs. This architecture has been proposed as an approach for realizing massive MIMO systems with reasonable power consumption. First, we investigate the effectiveness of mixed-ADC architectures in overcoming the channel estimation error caused by coarse quantization. For the channel estimation phase, we study to what extent one can combat the SE loss by exploiting just N << M pairs of high-resolution ADCs. We extend the round-robin training scheme for mixed-ADC systems to include both high-resolution and one-bit quantized observations. Then, we analyze the impact of the resulting channel estimation error in the data detection phase. We consider random high-resolution ADC assignment and also analyze a simple antenna selection scheme to increase the SE. Analytical expressions are derived for the SE for maximum ratio combining (MRC) and numerical results are presented for zero-forcing (ZF) detection. Performance comparisons are made against systems with uniform ADC resolution and against mixed-ADC systems without round-robin training to illustrate under what conditions each approach provides the greatest benefit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hessam Pirzadeh, A. Lee Swindlehurst. 2018-04-30. Spectral Efficiency of Mixed-ADC Massive MIMO. https://doi.org/10.1109/tsp.2018.2833807

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