Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.03832

On Time-of-Arrival Estimation in NB-IoT Systems

Sha Hu·Xuhong Li·Fredrik Rusek
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider time-of-arrival (ToA) estimation of a first arrival-path for a device working in narrowband Internet-of-Things (NB-IoT) systems. Due to a limited 180 KHz bandwidth used in NB-IoT, the time-domain auto-correlation function (ACF) of transmitted NB positioning reference signal (NPRS) has a wide main lobe. Without considering that, the performance of ToA estimation can be degraded for two reasons. Firstly, under multiple-path channel environments, the NPRS corresponding to different received paths are superimposed on each other, and so are the cross-correlations corresponding to them. Secondly, the measured peak-to-average-power-ratio (PAPR) used for detecting the presence of NPRS is inaccurate. Therefore, in this paper we propose a space-alternating generalized expectation-maximization (SAGE) based method to jointly estimate the number of channel taps, the channel coefficients and the corresponding delays in NB-IoT systems, with considering the imperfect ACF of NPRS. Such a proposed method only uses the time-domain cross-correlations between the received signal and the transmitted NPRS, and has a low complexity. We show through simulations that, the ToA estimation of the proposed method performs close to the maximum likelihood (ML) estimation for a single-path channel, and significantly outperforms a traditional ToA estimator that uses signal-to-noise (SNR) or power thresholds based estimation.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sha Hu, Xuhong Li, Fredrik Rusek. 2017-11-10. On Time-of-Arrival Estimation in NB-IoT Systems. https://arxiv.org/abs/1711.03832

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↗