Search arXivSearch

arXiv · 2604.04031

Environment-Aware Near-Field Channel Estimation Leveraging CKM and ISAC

Abstract

This paper proposes an environment-aware near-field channel estimation framework for integrated sensing and communication (ISAC) systems equipped with extremely large-scale antenna arrays (ELAAs). The proposed framework jointly exploits channel knowledge maps (CKMs) and ISAC to obtain a priori information on static and dynamic environmental features for facilitating channel estimation. In particular, we propose a novel CKM representation, termed the virtual object map (VOM), which stores the locations of virtual environment objects (EOs) to characterize the dominant multipath components (MPCs) induced by static physical EOs. In addition, we design a sensing-assisted channel training protocol, in which the ISAC-enabled base station (BS) transmits downlink pilots while simultaneously collecting monostatic echoes for sensing dynamic targets in the environment, and the user equipment (UE) feeds back a quantized version of its received pilot observation. Based on the VOM prior and the sensed dynamic information, the BS jointly estimates the coefficients of the static and dynamic MPCs to recover the near-field channel. Numerical results demonstrate that the proposed joint VOM- and sensing-aided channel estimation scheme significantly outperforms conventional schemes without VOM-based priors and/or dynamic sensing in terms of both channel estimation accuracy and achievable rate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuan Guo, Yilong Chen, Zixiang Ren, Jie Xu. 2026-04-05. Environment-Aware Near-Field Channel Estimation Leveraging CKM and ISAC. https://arxiv.org/abs/2604.04031

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