Self-Supervised Millimeter Wave Indoor Localization using Tiny Neural Networks

The quasi-optical propagation of millimeter-wave signals enables high-accuracy localization algorithms that employ geometric approaches or machine learning models. However, most algorithms require information on the indoor environment, may entail the collection of large training datasets, or bear an infeasible computational burden for commercial off-the-shelf (COTS) devices. In this work, we propose to use tiny neural networks (NNs) to learn the relationship between angle difference-of-arrival (ADoA) measurements and locations of a receiver in an indoor environment. To relieve training data collection efforts, we resort to a self-supervised approach by bootstrapping the training of our neural network through location estimates obtained from a state-of-the-art localization algorithm. We evaluate our scheme via mmWave measurements from indoor 60-GHz double-directional channel sounding. We process the measurements to yield dominant multipath components, use the corresponding angles to compute ADoA values, and finally obtain location fixes. Results show that the tiny NN achieves sub-meter errors in 74\% of the cases, thus performing as good as or even better than the state-of-the-art algorithm, with significantly lower computational complexity.

A Framework for Developing and Evaluating Algorithms for Estimating Multipath Propagation Parameters from Channel Sounder Measurements

A framework is proposed for developing and evaluating algorithms for extracting multipath propagation components (MPCs) from measurements collected by channel sounders at millimeter-wave frequencies. Sounders equipped with an omnidirectional transmitter and a receiver with a uniform planar array (UPA) are considered. An accurate mathematical model is developed for the spatial frequency response of the sounder that incorporates the non-ideal cross-polar beampatterns for the UPA elements. Due to the limited Field-of-View (FoV) of each element, the model is extended to accommodate multi-FoV measurements in distinct azimuth directions. A beamspace representation of the spatial frequency response is leveraged to develop three progressively complex algorithms aimed at solving the singlesnapshot maximum likelihood estimation problem: greedy matching pursuit (CLEAN), space-alternative generalized expectationmaximization (SAGE), and RiMAX. The first two are based on purely specular MPCs whereas RiMAX also accommodates diffuse MPCs. Two approaches for performance evaluation are proposed, one with knowledge of ground truth parameters, and one based on reconstruction mean-squared error. The three algorithms are compared through a demanding channel model with hundreds of MPCs and through real measurements. The results demonstrate that CLEAN gives quite reasonable estimates which are improved by SAGE and RiMAX. Lessons learned and directions for future research are discussed.

A Framework for Developing Algorithms for Estimating Propagation Parameters from Measurements

A framework is proposed for developing and evaluating algorithms for extracting multipath propagation components (MPCs) from measurements collected by sounders at millimeter-wave (mmW) frequencies. To focus on algorithmic performance, an idealized model is proposed for the spatial frequency response of the propagation environment measured by a sounder. The input to the sounder model is a pre-determined set of MPC parameters that serve as the "ground truth." A three-dimensional angle-delay (beamspace) representation of the measured spatial frequency response serves as a natural domain for implementing and analyzing MPC extraction algorithms. Metrics for quantifying the error in estimated MPC parameters are introduced. Initial results are presented for a greedy matching pursuit algorithm that performs a least-squares (LS) reconstruction of the MPC path gains within the iterations. The results indicate that the simple greedy-LS algorithm has the ability to extract MPCs over a large dynamic range, and suggest several avenues for further performance improvement through extensions of the greedy-LS algorithm as well as by incorporating features of other algorithms, such as SAGE and RIMAX.