Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.12629

Rate Maximization for Downlink Pinching-Antenna Systems

Yanqing Xu·Zhiguo Ding·George K. Karagiannidis
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this letter, we consider a new type of flexible-antenna system, termed pinching-antenna, where multiple low-cost pinching antennas, realized by activating small dielectric particles on a dielectric waveguide, are jointly used to serve a single-antenna user. Our goal is to maximize the downlink transmission rate by optimizing the locations of the pinching antennas. However, these locations affect both the path losses and the phase shifts of the user's effective channel gain, making the problem challenging to solve. To address this challenge and solve the problem in a low complexity manner, a relaxed optimization problem is developed that minimizes the impact of path loss while ensuring that the received signals at the user are constructive. This approach leads to a two-stage algorithm: in the first stage, the locations of the pinching antennas are optimized to minimize the large-scale path loss; in the second stage, the antenna locations are refined to maximize the received signal strength. Simulation results show that pinching-antenna systems significantly outperform conventional fixed-location antenna systems, and the proposed algorithm achieves nearly the same performance as the highly complex exhaustive search-based benchmark.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanqing Xu, Zhiguo Ding, George K. Karagiannidis. 2025-02-18. Rate Maximization for Downlink Pinching-Antenna Systems. https://arxiv.org/abs/2502.12629

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↗