Search arXivSearch

arXiv · 2411.02008

Flexible Multi-Beam Synthesis and Directional Suppression Through Transmissive RIS

Abstract

Despite extensive research on reconfigurable intelligent surfaces (RISs) in recent years, existing beamforming methods still face significant challenges in achieving flexible and robust beam synthesis, which is an essential capability for a wide range of communication scenarios. This paper introduces a Max-min criterion with nonlinear constraints, leveraging optimization techniques to simultaneously enable flexible multi-beam synthesis and directional suppression using transmissive RIS. Firstly, a realistic model grounded in geometrical optics is introduced to characterize the input/output behaviors of transmissive RISs, effectively bridging the gap between explicit beamforming requirements and practical implementations. Subsequently, a highly efficient algorithm for constrained Max-min optimizations involving quadratic forms is developed. By introducing an auxiliary variable and applying the compensated convexity transform, we successfully reformulate the original non-convex problem and obtain the optimal solution iteratively. This approach is readily applicable to a wide range of constrained Max-min optimization problems. Finally, numerical simulations and prototype experiments are conducted to validate the effectiveness of the proposed framework. The results demonstrate that the proposed algorithm can effectively enhance or selectively suppress signal beams in designated spatial directions, outperforming existing methods in terms of beam control accuracy and robustness. This framework provides valuable insights and references for practical communications applications such as physical layer security and interference mitigation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rujing Xiong, Ke Yin, Jialong Lu, Kai Wan, Tiebin Mi, Robert Caiming Qiu. 2025-05-27. Flexible Multi-Beam Synthesis and Directional Suppression Through Transmissive RIS. https://arxiv.org/abs/2411.02008

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