aNGLE: aNGular Location Estimation algorithms

19Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present two localization algorithms that exploit the angle of arrival (aoa) parameters of the received signal. The proposed aNGular Location Estimation (aNGLE) algorithms utilize a probabilistic model to describe the angular response of the received signal. Consequently, the aNGLE algorithms can estimate the location of a transmitter using a single step Hadamard product. The first algorithm utilizes a Single Sample of the received signal (aNGLE-SS). The second algorithm, on the other hand, employs the signal Subspace Decomposition technique (aNGLE-SD). The localization capabilities of the aNGLE algorithms have been experimentally investigated in an office environment. The performances of the aNGLE algorithms have been validated against the performances of several aoa-based localization systems. The experimental results show that the aNGLE-SD algorithm outperforms all the studied aoa-based localization systems. The aNGLE-SS algorithm, on the other hand, outperforms every localization system that utilizes less than 50 samples of the received signal. The aNGLE algorithms are flexible, generic and computationally very efficient. These features allow the aNGLE algorithms to be easily deployed in any existing aoa-based localization system.

Cite

CITATION STYLE

APA

Bnilam, N., Tanghe, E., Steckel, J., Joseph, W., & Weyn, M. (2020). aNGLE: aNGular Location Estimation algorithms. IEEE Access, 8, 14620–14629. https://doi.org/10.1109/aCCESS.2020.2966519

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free