Search arXivSearch

arXiv · 2609.22756

Two-Stage Refinement Sparse Channel Estimation for Reconfigurable Intelligent Metasurface Antenna (RIMSA) Massive MIMO

Abstract

To meet the increasing demands for high data rates and large capacity, next generation wireless communication systems require transceivers equipped with a large number of antennas. Massive multiple-input multiple-output (MIMO) with metasurface antennas has emerged as a promising solution. In this paper, we investigate the channel estimation problem for the emerging reconfigurable intelligent metasurface antenna (RIMSA) array systems. Specifically, we develop a two-stage refinement (TSR) channel estimation method based on the compressed sensing (CS) principle. In the first stage, we exploit the antenna structure of RIMSA to receive pilots by setting identical phase response vectors across all RIMSAs. In this manner, the coherence of the measurement matrix under the CS framework is reduced and the channel estimation performance is improved. However, this special design introduces channel direction-of-arrival (DoA) estimation ambiguity and yields an ambiguous candidate DoA set. In the second stage, we optimize the phase responses of the metamaterial elements to resolve the ambiguity and accurately estimate the DoAs and channel coefficients. Overall, the estimation accuracy is improved in the first stage at the cost of ambiguity, and this ambiguity is eliminated in the second stage. We illustrate the performance advantages of the TSR method by presenting the numerical results and comparing it with the existing methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yakun Ma, Hui-Ming Wang, Jiaping He, Qingli Yan. 2026-09-19. Two-Stage Refinement Sparse Channel Estimation for Reconfigurable Intelligent Metasurface Antenna (RIMSA) Massive MIMO. https://arxiv.org/abs/2609.22756

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