Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1512.06383

Tracking Angles of Departure and Arrival in a Mobile Millimeter Wave Channel

Chuang Zhang·Dongning Guo·Pingyi Fan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Millimeter wave provides a very promising approach for meeting the ever-growing traffic demand in next generation wireless networks. To utilize this band, it is crucial to obtain the channel state information in order to perform beamforming and combining to compensate for severe path loss. In contrast to lower frequencies, a typical millimeter wave channel consists of a few dominant paths. Thus it is generally sufficient to estimate the path gains, angles of departure (AoDs), and angles of arrival (AoAs) of those paths. Proposed in this paper is a dual timescale model to characterize abrupt channel changes (e.g., blockage) and slow variations of AoDs and AoAs. This work focuses on tracking the slow variations and detecting abrupt changes. A Kalman filter based tracking algorithm and an abrupt change detection method are proposed. The tracking algorithm is compared with the adaptive algorithm due to Alkhateeb, Ayach, Leus and Heath (2014) in the case with single radio frequency chain. Simulation results show that to achieve the same tracking performance, the proposed algorithm requires much lower signal-to-noise-ratio (SNR) and much fewer pilots than the other algorithm. Moreover, the change detection method can always detect abrupt changes with moderate number of pilots and SNR.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chuang Zhang, Dongning Guo, Pingyi Fan. 2015-12-20. Tracking Angles of Departure and Arrival in a Mobile Millimeter Wave Channel. https://arxiv.org/abs/1512.06383

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗