Search arXivSearch

arXiv · 1709.06698

Blind Estimation of Sparse Broadband Massive MIMO Channels with Ideal and One-bit ADCs

Abstract

We study the maximum likelihood problem for the blind estimation of massive mmWave MIMO channels while taking into account their underlying sparse structure, the temporal shifts across antennas in the broadband regime, and ultimately one-bit quantization at the receiver. The sparsity in the angular domain is exploited as a key property to enable the unambiguous blind separation between user's channels. The main advantage of this approach is the fact that the overhead due to pilot sequences can be dramatically reduced especially when operating at low SNR per antenna. In addition, as sparsity is the only assumption made about the channel, the proposed method is robust with respect to the statistical properties of the channel and data and allows the channel estimation and the separation of interfering users from adjacent base stations to be performed in rapidly time-varying scenarios. For the case of one-bit receivers, a blind channel estimation is proposed that relies on the Expectation Maximization (EM) algorithm. Additionally, performance limits are derived based on the clairvoyant Cramer Rao lower bound. Simulation results demonstrate that this maximum likelihood formulation yields superior estimation accuracy in the narrowband as well as the wideband regime with reasonable computational complexity and limited model assumptions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amine Mezghani, A. Lee Swindlehurst. 2017-09-20. Blind Estimation of Sparse Broadband Massive MIMO Channels with Ideal and One-bit ADCs. https://doi.org/10.1109/tsp.2018.2821640

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