Search arXivSearch

arXiv · 2211.05976

Codebook-Based Solutions for Reconfigurable Intelligent Surfaces and Their Open Challenges

Abstract

Reconfigurable intelligent surfaces (RIS) is a revolutionary technology to cost-effectively improve the performance of wireless networks. We first review the existing framework of channel estimation and passive beamforming (CE & PBF) in RIS-assisted communication systems. To reduce the excessive pilot signaling overhead and implementation complexity of the CE & PBF framework, we conceive a codebook-based framework to strike flexible tradeoffs between communication performance and signaling overhead. Moreover, we provide useful insights into the codebook design and learning mechanisms of the RIS reflection pattern. Finally, we analyze the scalability of the proposed framework by flexibly adapting the training overhead to the specified quality-of-service requirements and then elaborate on its appealing advantages over the existing CE & PBF approaches. It is shown that our novel codebook-based framework can be beneficially applied to all RIS-assisted scenarios and avoids the curse of model dependency faced by its existing counterparts, thus constituting a competitive solution for practical RIS-assisted communication systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiancheng An, Chao Xu, Qingqing Wu, Derrick Wing Kwan Ng, Marco Di Renzo, Chau Yuen, Lajos Hanzo. 2022-11-11. Codebook-Based Solutions for Reconfigurable Intelligent Surfaces and Their Open Challenges. https://arxiv.org/abs/2211.05976

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