Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2311.13875

Max-Min SINR Analysis of STAR-RIS Assisted Massive MIMO Systems with Hardware Impairments

Anastasios Papazafeiropoulos·Pandelis Kourtessis·Symeon Chatzinotas
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surface (RIS) has emerged as a cost-effective solution to improve wireless communication performance through just passive reflection. Recently, the concept of simultaneously transmitting and reflecting RIS (STAR-RIS) has appeared but the study of minimum signal-to-interference-plus-noise ratio (SINR) and the impact of hardware impairments (HWIs) remain open. In addition to previous works on STAR-RIS, we consider a massive multiple-input multiple-output (mMIMO) base station (BS) serving multiple user equipments (UEs) at both sides of the RIS. Specifically, in this work, focusing on the downlink of a single cell, we derive the minimum SINR obtained by the optimal linear precoder (OLP) with HWIs in closed form. The OLP maximises the minimum SINR subject to a given power constraint for any given passive beamforming matrix (PBM). Next, we obtain deterministic equivalents (DEs) for the OLP and the minimum SINR, which are then used to optimise the PBM. Notably, based on the DEs and statistical channel state information (CSI), we optimise simultaneously the amplitude and phase shift by using a projected gradient ascent algorithm (PGAM) for both energy splitting (ES) and mode switching (MS) STAR-RIS operation protocols with reduced feedback, \textcolor{black}{which is quite crucial for STAR-RIS systems that include the double number or variables compared to reflecting only RIS.} Simulations verify the analytical results, shed light on the impact of HWIs, and demonstrate the better performance of STAR-RIS compared to conventional RIS.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasios Papazafeiropoulos, Pandelis Kourtessis, Symeon Chatzinotas. 2023-11-23. Max-Min SINR Analysis of STAR-RIS Assisted Massive MIMO Systems with Hardware Impairments. https://arxiv.org/abs/2311.13875

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗