Search arXivSearch

arXiv · 2311.10295

How Much Time is Required for Phase Shift Delivery in RIS-Aided Wireless Systems?

Abstract

Reconfigurable intelligent surface (RIS) has become a focal point of extensive research due to its remarkable "squared gain". However, achieving a substantial beamforming gain typically requires a significant number of elements, which leads to a non-negligible overhead that forwards the coherent phase shift to the RIS. Different from previous works, which primarily focus on the information transmission phase, we consider the phase delivery overhead during the phase-shift delivery phase to explore the trade-off between performance and overhead. To reduce the phase delivery overhead via the control link, we introduce a hybrid phase shift mechanism, encompassing both the coherent and fixed phase shifts. Specifically, a beamforming problem is formulated for maximizing the throughput. In light of the intractability of the problem, we develop an alternating optimization-based iterative algorithm by combining quadratic transformation and successive convex approximation. To gain more insights, we derive the closed-form expression of the number of elements adopting the coherent phase shift in the large signal-to-noise ratio region. This expression serves as a valuable guide for the practical implementation of the RIS technology. Our simulation results conclusively demonstrate the effectiveness of the proposed algorithm in achieving a favorable trade-off between throughput and overhead. Furthermore, the introduction of the hybrid phase shift approach significantly reduces phase delivery overhead while concurrently enhancing the system throughput.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hao Xie, Dong Li. 2023-11-17. How Much Time is Required for Phase Shift Delivery in RIS-Aided Wireless Systems?. https://arxiv.org/abs/2311.10295

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