Search arXivSearch

arXiv · 2510.24246

Precoding-free Hierarchical Rate-Splitting Multiple Access via Stacked Intelligent Metasurface

Abstract

Interference management is a central bottleneck in dense multi-antenna wireless networks. Therefore, in this study, we present a digital precoding-free hierarchical rate-splitting multiple access (HRSMA) architecture assisted by a stacked intelligent metasurface (SIM) to achieve high spectral efficiency and user fairness with reduced hardware complexity. In the proposed system, the base station performs only scalar power allocation, while a multi-layer SIM acts as a wave-domain processor that spatially separates users and mitigates interference via nonlinear wavefront reconfiguration. This design eliminates the need for digital or hybrid precoding, drastically reducing the baseband computations. A joint optimization problem is formulated to maximize the minimum user rate by jointly optimizing SIM phase shifts, power allocation, and user grouping. To efficiently solve the resulting non-convex problem, an alternating optimization algorithm is developed, combining simultaneous perturbation stochastic approximation (SPSA) for SIM configuration and power control with clustering-based grouping refinement. Simulation results demonstrate that the proposed SIM-aided HRSMA achieves substantial gains in both spectral efficiency and fairness compared to hybrid beamforming and non-precoding baselines. Specifically, SIM-aided HRSMA attains comparable or superior minimum rates with significantly fewer active antennas by exploiting the additional wave-domain degrees of freedom provided by multi-layer SIMs. These findings highlight the potential of SIM-aided HRSMA as a low-cost, energy-efficient, and scalable solution for beyond-6G networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroaki Hashida, Boya Di. 2025-10-28. Precoding-free Hierarchical Rate-Splitting Multiple Access via Stacked Intelligent Metasurface. https://arxiv.org/abs/2510.24246

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