Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2405.18701

Near-Field Localization with RIS via Two-Dimensional Signal Path Classification

Jeongwan Kang·Seung-Woo Ko·Sunwoo Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we propose two-dimensional signal path classification (2D-SPC) for reconfigurable intelligent surface (RIS)-assisted near-field (NF) localization. In the NF regime, multiple RIS-driven signal paths (SPs) can contribute to precise localization if these are decomposable and the reflected locations on the RIS are known, referred to as SP decomposition (SPD) and SP labeling (SPL), respectively. To this end, each RIS element modulates the incoming SP's phase by shifting it by one of the values in the phase shift profile (PSP) lists satisfying resolution requirements. By interworking with a conventional orthogonal frequency division multiplexing (OFDM) waveform, the user equipment can construct a 2D spectrum map that couples each SPs time of arrival (ToA) and PSP. Then, we design SPL by mapping SPs with the corresponding reflected RIS elements when they share the same PSP. Given two unlabeled SPs, we derive a geometric discriminant from checking whether the current label is correct. It can be extended to more than three SPs by sorting them using pairwise geometric discriminants between adjacent ones. From simulation results, it has been demonstrated that the proposed 2D SPC achieves consistent localization accuracy even if insufficient PSPs are given.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeongwan Kang, Seung-Woo Ko, Sunwoo Kim. 2024-05-29. Near-Field Localization with RIS via Two-Dimensional Signal Path Classification. https://arxiv.org/abs/2405.18701

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deep Learning-Enhanced Real-Time Wi-Fi Sensing Through Single Transceiver Pair

The advancement of next-generation Wi-Fi technology heavily relies on sensing capabilities, which play a pivotal role in enabling sophisticated applications. In response to the growing demand for large-scale deployments, contemporary Wi-Fi sensing systems strive to achieve high-precision perception while maintaining minimal bandwidth consumption and antenna count requirements. Remarkably, various deep learning-driven perception technologies have demonstrated the ability to surpass conventional resolution limits. However, the theoretical underpinnings of this phenomenon have not been thoroughly investigated in existing research. We find that under hardware-constrained conditions, the performance gains of deep learning in Wi-Fi sensing primarily originate from two aspects: prior information and temporal correlation, which act as specific forms of side information that reduce the estimation error bound. We construct a deep learning-based Wi-Fi sensing system using only a single transceiver pair and design experiments to validate these gains. The system achieves an average human pose estimation error of 0.2189 m and an average localization error of 0.6124 m, while operating in real time at 42 fps on commodity hardware.

eess.SP↗
arXiv2026

Beam Scheduling for Cross-Layer ISAC: A Deep Reinforcement Learning Approach

Resource allocation in integrated sensing and communication (ISAC) systems needs to be optimized to balance the requirements of the communication and sensing modules considering complicated cross-layer data traffic and queue status in dynamic multi-user environments. This paper studies the beam allocation for cross-layer ISAC that achieves low-latency communication and minimizes sensing parameters estimation error. To handle the complex coupling between practical data buffer dynamics and varying wireless channels, we propose a deep reinforcement learning (DRL)-assisted approach. Rather than relying on explicit channel state information, the DRL-assisted beam allocation reduces feedback overhead by leveraging sensing observations. Simulation results verify that the DRL framework effectively takes buffer status into account and adapts to the wireless environment while allocating resources. The proposed multi-beam scheme improves overall throughput with only modest delay increases. Finally, the DRL-assisted beam management achieves both communication and sensing performance close to that of the genie-aided benchmark with perfect angle-of-departure (AoD) knowledge. These contributions advance the state-of-the-art intelligent resource management for ISAC systems.

eess.SP↗
arXiv2026

Active Perception for Radio Map Reconstruction in Uncharted 3D Air-Ground Environments

Radio maps provide the essential foundation for low altitude networking systems. Unlike terrestrial radio maps that are typically generated via drive test measurements, mapping the air-ground environment requires the deployment of unmanned aerial vehicles (UAVs). This shift introduces two formidable challenges in uncharted 3D scenarios. First, sparse radio measurements and incomplete geometric observations hinder accurate reconstruction. Second, the large 3D action space and strict power constraints from high spectrum scanner energy consumption make informative exploration difficult. To address these issues, this paper proposes 3D uncertainty aware radio active mapping (3D-URAM), a closed-loop active perception framework that decouples the mapping process into two offline trained stages. In Stage I, a Bayesian U-Net is developed to recover radio maps from sparse measurements and partial geometry while providing predictive uncertainty. In Stage II, a dynamic probabilistic roadmap and a Transformer-based waypoint selection policy trained via proximal policy optimization maximize long horizon uncertainty reduction under travel budgets. Experimental results demonstrate that 3D-URAM reduces reconstruction error by over 50% compared to representative baselines. Real-world field tests within a 300mx200m space also validate the potential of active radio map reconstruction

eess.SP↗