Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.11973

Pinching-Antenna-Assisted Integrated AirComp-NOMA: Joint Transceiver and Antenna-Position Optimization

Saeid Pakravan·Wessam Ajib·Wei-Ping Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Integrating over-the-air computation (AirComp) with non-orthogonal multiple access (NOMA) enables concurrent data aggregation and information transmission, but tightly couples computation accuracy with communication quality of service (QoS). This paper investigates a pinching-antenna-assisted uplink, where flexible pinching-antenna (PA) placement provides additional spatial degrees of freedom to manage this coupling. We minimize the AirComp mean-squared error (MSE) subject to NOMA QoS, transmit-power, and PA deployment constraints by jointly designing the AirComp transceiver, PA positions, and successive interference cancellation (SIC) order. Exploiting the recursive structure of uplink SIC, we establish an exact NOMA feasibility condition and derive an optimal SIC-ordering rule. These structural results eliminate the NOMA power variables and the combinatorial search over decoding orders, reducing the original problem to a continuous optimization problem. We then develop an iterative algorithm with optimal AirComp transmit-coefficient and receive-scaling updates and a feasibility-preserving majorization scheme for PA placement. The proposed algorithm preserves NOMA feasibility while generating a monotonically nonincreasing computation-MSE sequence. Numerical results demonstrate the computation-accuracy gains of jointly optimizing the AirComp transceiver and PA positions under NOMA QoS requirements.

Explore related subjects

eess.SP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saeid Pakravan, Wessam Ajib, Wei-Ping Zhu. 2026-10-08. Pinching-Antenna-Assisted Integrated AirComp-NOMA: Joint Transceiver and Antenna-Position Optimization. https://arxiv.org/abs/2610.11973

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Secure Over-the-Air Computation Against Multiple Eavesdroppers using Correlated Artificial Noise

Over-the-air (OtA) computation enables scalable analog aggregation by exploiting the superposition property of wireless channels, making it an attractive joint communication and computation paradigm for distributed sensing and learning. However, the uncoded nature of analog transmission exposes the computation result to eavesdropping, and the fundamental security limits of OtA computation against multiple cooperating adversaries remain poorly understood. In this paper, we develop an estimation-theoretic framework for analyzing the security of analog OtA computation in the presence of multiple distributed eavesdroppers that may jointly process their observations. We first derive the optimal estimator for cooperating eavesdroppers and bounds on the achievable estimation accuracy of both the legitimate receiver and the adversaries. Our analysis reveals a key insight: while random channel phase misalignment provides significant inherent MSE-security against individual eavesdroppers, this protection largely disappears once multiple eavesdroppers cooperate. Motivated by this observation, we propose a correlated artificial noise design based on zero-forcing that preserves the aggregation accuracy at the legitimate receiver while maximizing the estimation error at the cooperative eavesdroppers. Numerical results demonstrate that the proposed design substantially reduces the security advantage gained through eavesdropper cooperation and achieves security close to uncorrelated artificial-noise schemes without sacrificing computation accuracy. These results provide both a theoretical characterization of the security limits of analog OtA computation and a practical design guideline for its secure deployment in real-world wireless systems.

eess.SP↗
arXiv2026

Distributed Riemannian Optimization in Geodesically Non-convex Environments

This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy called diffusion adaptation to Riemannian manifolds, we show that the resulting algorithm, the Riemannian diffusion adaptation, provably exhibits several desirable behaviors when minimizing a sum of geodesically smooth non-convex functions over manifolds of bounded curvature. More specifically, we establish that the algorithm can approximately achieve network agreement in the sense that Fréchet variance of the iterates among the agents is small. Moreover, the algorithm is guaranteed to converge to a neighborhood of a first-order stationary point for general geodesically non-convex cost functions. When the global cost function additionally satisfies the local Riemannian Polyak-Lojasiewicz (PL) condition, we also show that it converges linearly under a constant step size up to a steady-state error. Finally, we apply this algorithm to decentralized robust principal component analysis (PCA) and low-rank matrix completion problems and illustrate its convergence and performance through numerical simulations.

eess.SP↗
arXiv2026

Integrated sensing and communications in the 3GPP New Radio: sensing limits

Integrated Sensing and Communications (ISAC) is regarded as a key element of the beyond-fifth-generation (5G) and sixth-generation (6G) systems, raising the question of whether current 5G New Radio (NR) signal structures can meet the sensing accuracy requirements specified by the Third Generation Partnership Project (3GPP). This paper addresses this issue by analyzing the fundamental limits of range and velocity estimation through the Cramér-Rao lower bound (CRLB) for a monostatic unmanned aerial vehicle (UAV) sensing use case currently under consideration in the 3GPP standardization process. The study focuses on standardized signals and also evaluates the potential performance gains achievable with reference signals specifically designed for sensing purposes. The compact CRLB expressions derived in this work highlight the fundamental trade-offs between estimation accuracy and system parameters. The results further indicate that information from multiple slots must be exploited in the estimation process to attain the performance targets defined by the 3GPP. As a result, the 5G NR positioning reference signal (PRS), whose patterns may be suboptimal for velocity estimation when using single-slot resources, becomes suitable when multislot estimation is employed. Finally, we propose a two-step iterative range and radial-velocity estimator that attains the CRLB over a significantly wider range of distances than conventional maximum-likelihood (ML) estimators, for which the well-known threshold effect severely limits the distance range over which the accuracy requirements imposed by the 3GPP are satisfied.

eess.SP↗