Search arXivSearch

arXiv · 1806.02005

Swift-Link: A compressive beam alignment algorithm for practical mmWave radios

Abstract

Next generation wireless networks will exploit the large amount of spectrum available at millimeter wave (mmWave) frequencies. Design of mmWave systems, however, is challenging due to strict power, cost and hardware constraints at higher bandwidths. To achieve a good SNR for communication, mmWave systems use large antenna arrays. Beamforming with highly directional beams is one way to use the antennas. As the channel changes over time, the beams that maximize the SNR have to be estimated quickly to reduce the training overhead. Prior work has exploited the observation that mmWave channels are sparse to perform compressed sensing (CS) based beam alignment with few channel measurements. Most of the existing CS-based algorithms, however, assume perfect synchronization and fail in the presence of carrier frequency offset (CFO). This paper presents Swift-Link, a fast beam alignment algorithm that is robust against the offset. Swift-Link includes a novel randomized beam training sequence that minimizes the beam alignment errors due to CFO and a low-complexity algorithm that corrects these errors. Even with strict hardware constraints, our algorithm uses fewer channel measurements than comparable CS algorithms and has analytical guarantees. Swift-Link requires a small output dynamic range at the analog-to-digital converter compared to beam-scanning techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nitin Jonathan Myers, Amine Mezghani, Robert W. Heath Jr. 2018-12-04. Swift-Link: A compressive beam alignment algorithm for practical mmWave radios. https://doi.org/10.1109/tsp.2018.2886168

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