Search arXivSearch

arXiv · 2605.02401

Cross-Domain Radiomap Prediction for Multi-Scatterer Environment: A Spherical-Wave-Based Approach

Abstract

Radiomap prediction has found extensive applications in network planning and optimization. The radiomap is implicitly determined by electromagnetic (EM) wave propagation. The evolution of wireless communication toward higher frequency spectra has highlighted the effect of mesoscopic (i.e. wavelength-comparable scale) scatterers, which is negligible in the sub-6 GHz spectrum. To address this challenge, we develop a linear forward channel model to capture the propagation behavior in the multi-scatterer environment. The proposed model utilizes spherical-wave mode expansion to track the source radiation pattern, including scattering from a single scatterer and interactions among multiple scatterers. Both phenomena are represented as a superposition of spherical-wave modes, effectively capturing the multipath effect from a wave-based perspective. This forward model is then employed to formulate an inverse optimization problem, where the scattering responses and scatterer locations are jointly learned from sparse field measurements. Simulation results demonstrate that the proposed model accurately reconstructs and extrapolates the radiomap in both the spatial and the beam domain, further enables frequency-domain channel interpolation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenli Li, Bin Wang, Haiyan Fan, Yujie Zhang, Guangxu Zhu, Yi Zhang. 2026-07-06. Cross-Domain Radiomap Prediction for Multi-Scatterer Environment: A Spherical-Wave-Based Approach. https://arxiv.org/abs/2605.02401

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

KEEP EXPLORING

Related papers

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

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

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