Search arXivSearch

arXiv · 1912.10347

Low-Complexity Random Rotation-based Schemes for Intelligent Reflecting Surfaces

Abstract

The employment of intelligent reflecting surfaces (IRSs) is a potential and promising solution to increase the spectral and energy efficiency of wireless communication networks. Despite their many advantages, IRS-aided communications have limitations as they are subject to high propagation losses. To overcome this, the phase rotation (shift) at each element needs to be designed in such a way as to increase the channel gain at the destination. However, this increases the system's complexity as well as its power consumption. In this paper, we present an analytical framework for the performance of random rotation-based IRS-aided communications. Under this framework, we propose four low-complexity and energy efficient schemes, based on a coding or a selection approach. Both of these approaches employ random phase rotations and require limited knowledge of channel state information. Specifically, the coding-based schemes use time-varying random phase rotations to produce an equivalent time-varying channel. On the other hand, the selection-based schemes select a partition of the IRS elements based on the received signal power at the destination. Analytical expressions for the achieved outage probability and energy efficiency of each scheme are derived. It is demonstrated that all schemes can provide significant performance gains as well as full diversity order.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Constantinos Psomas, Ioannis Krikidis. 2021-03-25. Low-Complexity Random Rotation-based Schemes for Intelligent Reflecting Surfaces. https://arxiv.org/abs/1912.10347

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