Search arXivSearch

arXiv · 2311.12473

Cooperative RIS and STAR-RIS assisted mMIMO Communication: Analysis and Optimization

Abstract

Reconfigurable intelligent surface (RIS) has emerged as a cost-effective and promising solution to extend the wireless signal coverage and improve the performance via passive signal reflection. Different from existing works which do not account for the cooperation between RISs or do not provide full space coverage, we propose the marriage of cooperative double-RIS with simultaneously transmitting and reflecting RIS (STAR-RIS) technologies denoted as RIS/STAR-RIS under correlated Rayleigh fading conditions to assist the communication in a massive multiple-input multiple-output (mMIMO) setup. The proposed architecture is superior since it enjoys the benefits of the individual designs. We introduce a channel estimation approach of the cascaded channels with reduced overhead. Also, we obtain the deterministic equivalent (DE) of the downlink achievable sum spectral efficiency (SE) in closed form based on large-scale statistics. Notably, relied on statistical channel state information (CSI), we optimise both surfaces by means of the projected gradient ascent method (PGAM), and obtain the gradients in closed form. The proposed optimization achieves to maximise the sum SE of such a complex system, and has low complexity and low overhead since it can be performed at every several coherence intervals. Numerical results show the benefit of the proposed architecture and verify the analytical framework. In particular, we show that the RIS/STAR-RIS architecture outperforms the conventional double-RIS or its single-RIS counterparts.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasios Papazafeiropoulos, Ahmet M. Elbir, Pandelis Kourtessis, Ioannis Krikidis, Symeon Chatzinotas. 2023-11-21. Cooperative RIS and STAR-RIS assisted mMIMO Communication: Analysis and Optimization. https://arxiv.org/abs/2311.12473

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