ITSPITJun 14

Sparse Channel Estimation for SIM-based mmWave Near-Field Communications

arXiv:2606.156343.0
Predicted impact top 83% in IT · last 90 daysOriginality Incremental advance
AI Analysis

It addresses the underdetermined channel estimation problem in SIM-based mmWave systems with near-field effects, offering a practical solution for future wireless communications.

This paper proposes a compressed sensing-based channel estimation protocol for SIM-based mmWave near-field communications, using a polar-domain transform matrix and a low-complexity sparse Bayesian learning algorithm to reduce computational complexity while maintaining estimation accuracy.

In this paper, we address the channel estimation (CE) problem in SIM-based multi-user (MU) millimeter-wave (mmWave) near-field communication systems. To address the severe path loss and blockage in mmWave communication systems, many meta-atoms are typically integrated into each layer of the SIM. Then, the number of radio frequency (RF) chains at the base station (BS) is fewer than that of meta-atoms per layer, resulting in an underdetermined problem. Additionally, the increase in the number of meta-atoms in each layer expands the SIM's near-field region, leading to the user equipment (UEs) being mostly situated in this region, necessitating precise modeling of the channel under the spherical wavefront assumption. To address these issues, we introduce a compressed sensing (CS)-based CE protocol to tackle the underdetermined problem. In contrast to the traditional CS-based estimation framework, we investigate a polar-domain channel representation to tackle the severe energy spread effect of the classical angular-domain channel representation in near-field communication systems. Specifically, we design a novel polar-domain transform matrix for uniform planar arrays (UPAs), thereby transforming the CE problem into a sparse recovery task of the paths' support set and complex gains. To overcome the limitations of the sparse Bayesian learning (SBL) framework in tackling high-dimensional dictionaries, we propose a low-complexity polar-domain SBL (LCPD-SBL) algorithm, which significantly reduces computational complexity without compromising estimation accuracy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes