Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.05917

Modeling and Beamforming Optimization for Pinching-Antenna Systems

Zhaolin Wang·Chongjun Ouyang·Xidong Mu·Yuanwei Liu·Zhiguo Ding
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Pinching-Antenna SyStem (PASS) is a revolutionary flexible antenna technology designed to enhance wireless communication by establishing strong line-of-sight (LoS) links, reducing free-space path loss and enabling antenna array reconfigurability. PASS uses dielectric waveguides with low propagation loss for signal transmission, radiating via a passive pinching antenna, which is a small dielectric element applied to the waveguide. This paper first proposes a physics-based hardware model for PASS, where the pinching antenna is modeled as an open-ended directional coupler, and the electromagnetic field behavior is analyzed using coupled-mode theory. A simplified signal model characterizes the coupling effect between multiple antennas on the same waveguide. Based on this, two power models are proposed: equal power and proportional power models. Additionally, a transmit power minimization problem is formulated/studied for the joint optimization of transmit and pinching beamforming under both continuous and discrete pinching antenna activations. Two algorithms are proposed to solve this multimodal optimization problem: the penalty-based alternating optimization algorithm and a low-complexity zero-forcing (ZF)-based algorithm. Numerical results show that 1) the ZF-based low-complexity algorithm performs similarly to the penalty-based algorithm, 2) PASS reduces transmit power by over 95% compared to conventional and massive MIMO, 3) discrete activation causes minimal performance loss but requires a dense antenna set to match continuous activation, and 4) the proportional power model yields performance comparable to the equal power model.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhaolin Wang, Chongjun Ouyang, Xidong Mu, Yuanwei Liu, Zhiguo Ding. 2025-06-12. Modeling and Beamforming Optimization for Pinching-Antenna Systems. https://arxiv.org/abs/2502.05917

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↗