mmWave Beam Alignment using Hierarchical Codebooks and Successive Subtree Elimination

7 Sep 2022  ·  Nathan Blinn, Matthieu Bloch ·

Treating the codewords in a beamforming codebook as the arms in a multi-armed bandit problem, we propose a best arm identification multi-armed bandit algorithm in the fixed-confidence setting for mmWave beam alignment initial access called Successive Subtree Elimination (SSE). The algorithm performance approaches that of state-of-the-art Bayesian algorithms at a fraction of the complexity and without requiring channel state information. The algorithm simultaneously exploits the benefits of hierarchical codebooks and the approximate unimodality of rewards to achieve fast beam steering, in a sense that we precisely define to provide fair comparison with existing algorithms. In particular, SSE outperforms other low-complexity algorithms in the low Signal-to-Noise Ratio (SNR) regime. The performance of SSE is demonstrated through the derivation of a closed-form sample complexity, which enables offline tuning of design parameters, as well as extensive simulations over slow fading channels.

PDF Abstract
No code implementations yet. Submit your code now

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here