Search arXivSearch

arXiv · 2609.23698

NOMA-Assisted Multi-User Hybrid Wireless-Fed Pinching-Antenna Systems

Abstract

This paper investigates a non-orthogonal multiple-access (NOMA)-assisted multi-user wireless-fed pinching-antenna system (Wi-PASS). A multi-antenna base station (BS) simultaneously serves one direct user and wirelessly feeds a full-duplex amplify-and-forward relay equipped with a directional horn receiver. The relay injects the NOMA waveform into a dielectric waveguide, and one position-adjustable pinching antenna serves two additional users. Under maximum-gain zero-forcing transmission, ideal successive interference cancellation, and an additive residual self-interference model, we minimize the total consumed power by jointly optimizing the BS powers, relay amplification factor, NOMA power coefficients, decoding order, and pinching-antenna position. For a fixed position and decoding order, a variable transformation reduces the resource-allocation problem to a strictly convex scalar problem and yields a closed-form global solution. The position-dependent decoding order partitions the waveguide into finitely many intervals, and the derivative of the optimized power is governed by a quadratic polynomial on each interval. Hence, the globally optimal position is found by evaluating a small finite candidate set. Simulations at 28~GHz over 1000 random user topologies show that the proposed architecture consistently requires the lowest consumed power among direct-transmission, array-fed, no-PASS, and equal-time orthogonal multiple-access (OMA) benchmarks. At target signal-to-interference-plus-noise ratios of 20, 25, and 30~dB, it reduces the average power by 19.2%, 21.1%, and 21.7%, respectively, relative to equal-time OMA, while preserving its advantage as the BS-relay distance and residual SI increase.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hui Yang, Peng Zhu, Ming Zeng, Ebrahim Bedeer, Saeid Pakravan, Yulei Wang. 2026-09-20. NOMA-Assisted Multi-User Hybrid Wireless-Fed Pinching-Antenna Systems. https://arxiv.org/abs/2609.23698

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