Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.05217

From Concept to Reality: 5G Positioning with Open-Source Implementation of UL-TDoA in OpenAirInterface

Adeel Malik·Mohsen Ahadi·Florian Kaltenberger·Klaus Warnke·Nguyen Tien Thinh·Nada Bouknana·Cedric Thienot·Godswill Onche·Sagar Arora
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents, for the first time, an open-source implementation of the 3GPP Uplink Time Difference of Arrival (UL-TDoA) positioning method using the OpenAirInterface (OAI) framework. UL-TDoA is a critical positioning technique in 5G networks, leveraging the time differences of signal arrival at multiple base stations to determine the precise location of User Equipment (UE). This implementation aims to democratize access to advanced positioning technology by integrating UL-TDoA capabilities into both the Radio Access Network (RAN) and Core Network (CN) components of OAI, providing a comprehensive and 3GPP-compliant solution. The development includes the incorporation of essential protocol procedures, message flows, and interfaces as defined by 3GPP standards. Validation is conducted using two distinct methods: an OAI-RF simulator-based setup for controlled testing and an O-RAN-based Localization Testbed at EURECOM in real-world conditions. The results demonstrate the viability of this open-source UL-TDoA implementation, enabling precise positioning in various environments. By making this implementation publicly available, the study paves the way for widespread research, development, and innovation in the field of 5G positioning technologies, fostering collaboration and accelerating the advancement of cellular network positioning.

Explore related subjects

cs.ITcs.ETcs.PFmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adeel Malik, Mohsen Ahadi, Florian Kaltenberger, Klaus Warnke, Nguyen Tien Thinh, Nada Bouknana, Cedric Thienot, Godswill Onche, Sagar Arora. 2025-03-17. From Concept to Reality: 5G Positioning with Open-Source Implementation of UL-TDoA in OpenAirInterface. https://arxiv.org/abs/2409.05217

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↗