Search arXivSearch

arXiv · 1811.04775

Fast Beam Alignment for Millimeter Wave Communications: A Sparse Encoding and Phaseless Decoding Approach

Abstract

In this paper, we studied the problem of beam alignment for millimeter wave (mmWave) communications, in which we assume a hybrid analog and digital beamforming structure is employed at the transmitter (i.e. base station), and an omni-directional antenna or an antenna array is used at the receiver (i.e. user). By exploiting the sparse scattering nature of mmWave channels, the beam alignment problem is formulated as a sparse encoding and phaseless decoding problem. More specifically, the problem of interest involves finding a sparse sensing matrix and an efficient recovery algorithm to recover the support and magnitude of the sparse signal from compressive phaseless measurements. A sparse bipartite graph coding (SBG-Coding) algorithm is developed for sparse encoding and phaseless decoding. Our theoretical analysis shows that, in the noiseless case, our proposed algorithm can perfectly recover the support and magnitude of the sparse signal with probability exceeding a pre-specified value from $\mathcal{O}(K^2)$ measurements, where $K$ is the number of nonzero entries of the sparse signal. The proposed algorithm has a simple decoding procedure which is computationally efficient and noise-robust. Simulation results show that our proposed method renders a reliable beam alignment in the low and moderate signal-to-noise ratio (SNR) regimes and presents a clear performance advantage over existing methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xingjian Li, Jun Fang, Huiping Duan, Zhi Chen, Hongbin Li. 2018-11-09. Fast Beam Alignment for Millimeter Wave Communications: A Sparse Encoding and Phaseless Decoding Approach. https://doi.org/10.1109/tsp.2019.2929460

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