TY - GEN
T1 - Fast Beam Tracking for Millimeter-Wave Systems under High Mobility
AU - Zhang, Deyou
AU - Li, Ang
AU - Shirvanimoghaddam, Mahyar
AU - Cheng, Peng
AU - Li, Yonghui
AU - Vucetic, Branka
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - In this paper, we propose a fast beam tracking strategy for mobile millimeter-wave systems, where the temporal variations of the angle of departure (AoD) are considered and modeled as a discrete Markov process. In contrast to most existing works that rely on the slow-fading assumption, we consider a more practical scenario in which the AoD can vary rapidly due to blockage and other environmental obstructions. In this case, the use of narrow training beams becomes inefficient, and therefore we propose to employ multiple radio-frequency chains generating wide beams to reduce the training time. By optimizing the selected training beams, we aim to minimize the average tracking error probability (ATEP). However, since the exact expression for ATEP is difficult to obtain, we derive its upper bound in a closed form, and aim to minimize this upper bound instead. The associated training beam sequence design problem is transformed into the construction of a bipartite graph that does not contain cycles of length 4, which is implemented with the progressive edge-growth algorithm. Numerical results demonstrate significant gains of the proposed beam tracking strategy over the existing benchmark methods.
AB - In this paper, we propose a fast beam tracking strategy for mobile millimeter-wave systems, where the temporal variations of the angle of departure (AoD) are considered and modeled as a discrete Markov process. In contrast to most existing works that rely on the slow-fading assumption, we consider a more practical scenario in which the AoD can vary rapidly due to blockage and other environmental obstructions. In this case, the use of narrow training beams becomes inefficient, and therefore we propose to employ multiple radio-frequency chains generating wide beams to reduce the training time. By optimizing the selected training beams, we aim to minimize the average tracking error probability (ATEP). However, since the exact expression for ATEP is difficult to obtain, we derive its upper bound in a closed form, and aim to minimize this upper bound instead. The associated training beam sequence design problem is transformed into the construction of a bipartite graph that does not contain cycles of length 4, which is implemented with the progressive edge-growth algorithm. Numerical results demonstrate significant gains of the proposed beam tracking strategy over the existing benchmark methods.
UR - https://www.scopus.com/pages/publications/85070186639
U2 - 10.1109/ICC.2019.8761896
DO - 10.1109/ICC.2019.8761896
M3 - 会议稿件
AN - SCOPUS:85070186639
T3 - IEEE International Conference on Communications
BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Conference on Communications, ICC 2019
Y2 - 20 May 2019 through 24 May 2019
ER -