Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.08417

Joint Beamforming Design for Multiuser MISO Downlink Aided by a Reconfigurable Intelligent Surface and a Relay

Mohanad Obeed·Anas Chaaban
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surfaces (RIS) have drawn considerable attention recently due to their controllable scattering elements that are able to direct electromagnetic waves into desirable directions. Although RISs share some similarities with relays, the two have fundamental differences impacting their performance. To harness the benefits of both relaying and RISs, a multi-user communication system is proposed in this paper wherein a relay and an RIS cooperate to improve performance in terms of energy efficiency. Using singular value decomposition (SVD), semidefinite programming (SDP), and function approximations, we propose different solutions for optimizing the beamforming matrices at the base-station (BS), the relay, and the phase shifts at the RIS to minimize the total transmit power subject to quality-of-service (QoS) constraints. The problem is solved in different cases when the relay operates in half-duplex and full-duplex modes and when the reflecting elements have continuous and discrete phase shifts. Simulation results are provided to compare the performance of the system with and without the RIS or the relay in both full-duplex and half-duplex modes, under different optimization solutions. Generally, the results show that the system with full-duplex relay and RIS cooperation outperforms all the other scenarios, and the contribution of full-duplex relay is higher than that of the RIS. However, an RIS performs better than a half-duplex relay when the required QoS is high. The results also show that increasing the number of RIS reflecting elements improves performance better in the presence of a relay than in its absence.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohanad Obeed, Anas Chaaban. 2021-04-30. Joint Beamforming Design for Multiuser MISO Downlink Aided by a Reconfigurable Intelligent Surface and a Relay. https://arxiv.org/abs/2104.08417

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↗