Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.07063

Multi-User Opportunistic Beamforming using Reconfigurable Surfaces

Qurrat-Ul-Ain Nadeem·Anas Chaaban·Merouane Debbah
View original source ↗Read source document ↗Export metadata ↓

Abstract

Multi-user (MU) diversity yields sum-rate gains by scheduling a user for transmission at times when its channel is near its peak. The only information required at the base station (BS) for scheduling is the users' signal-to-noise ratios (SNR)s. MU diversity gains are limited in environments with line-of-sight (LoS) channel components and/or spatial correlation. To remedy this, previous works have proposed opportunistic beamforming (OBF) using multiple antennas at the BS to transmit the same signal, modulated by time-varying gains, to the best user at each time slot. In this paper, we propose reconfigurable surface (RS)-assisted OBF to increase the range of channel fluctuations in a single-antenna broadcast channel (BC), where opportunistic scheduling (OS) strategy achieves the sum-rate capacity. The RS is abstracted as an array of passive reflecting elements, and is dumb in the sense that it only induces random phase shifts onto the impinging electromagnetic waves, without requiring any channel state information. We develop the sum-rate scaling laws under Rayleigh, Rician and correlated Rayleigh fading and show that RS-assisted OBF with only a single-antenna BS outperforms multi-antenna BS-assisted OBF. We also extend our results to OFDMA systems and the multi-antenna BC.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qurrat-Ul-Ain Nadeem, Anas Chaaban, Merouane Debbah. 2019-12-15. Multi-User Opportunistic Beamforming using Reconfigurable Surfaces. https://arxiv.org/abs/1912.07063

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↗