Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.07459

Reconfigurable Intelligent Surface Aided Wireless Localization

Yiming Liu·Erwu Liu·Rui Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

The advantages of millimeter-wave and large antenna arrays technologies for accurate wireless localization received extensive attentions recently. However, how to further improve the accuracy of wireless localization, even in the case of obstructed line-of-sight, is largely undiscovered. In this paper, the reconfigurable intelligent surface (RIS) is introduced into the system to make the positioning more accurate. First, we establish the three-dimensional RIS-assisted wireless localization channel model. After that, we derive the Fisher information matrix and the Cramer-Rao lower bound for evaluating the estimation of absolute mobile station position. Finally, we propose an alternative optimization method and a gradient decent method to optimize the reflect beamforming, which aims to minimize the Cramer-Rao lower bound to obtain a more accurate estimation. Our results show that the proposed methods significantly improve the accuracy of positioning, and decimeter-level or even centimeter-level positioning can be achieved by utilizing the RIS with a large number of reflecting elements.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yiming Liu, Erwu Liu, Rui Wang. 2020-09-16. Reconfigurable Intelligent Surface Aided Wireless Localization. https://arxiv.org/abs/2009.07459

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↗