Search arXiv⌕ Search

arXiv · 2610.41567

Channel Measurement and Characteristics Analysis for Indoor Flexible Pinching Antenna Systems in the mmWave Band

Abstract

Pinching antenna (PA) systems offer flexible antenna configurations for future wireless communications, yet how PA geometry, orientation, and position affect channel characteristics in practical environments remains insufficiently studied. To address this gap, this paper first presents an indoor PA system channel measurement campaign at 59.5~GHz. A dedicated time-domain channel sounder is developed with frequency conversion and a circular-waveguide-to-dielectric-waveguide transition to feed the radio frequency (RF) signal into a flexible dielectric waveguide. Using this platform, office measurements quantify channel attenuation and channel characteristics by examining four PA geometries, arc PA orientation, circle PA pinching position, and transmitter--receiver height difference. The channel measurement data are analyzed in terms of path loss, shadow fading, root-mean-square (RMS) delay spread, Rician K-factor, normalized capacity, and spatial similarity. Indoor path loss models for PA systems are fitted for each PA geometry. The results reveal geometry-dependent attenuation and shadow-fading variability, with the arc PA showing greater variability than the circle PA. Arc PA rotation shifts the delay spread and conditional K-factor distributions. Moving the circle PA produces nonmonotonic changes in delay spread and normalized capacity, while spatial similarity remains relatively high at many receiver locations as the pinching position changes. These observations provide an empirical basis for PA systems channel model and system design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haoyang Li, Weidong Liu, Songjiang Yang, Zhensheng Chen, Jing Zhu, Gaojie Chen, Wei Huang. 2026-10-30. Channel Measurement and Characteristics Analysis for Indoor Flexible Pinching Antenna Systems in the mmWave Band. https://arxiv.org/abs/2610.41567

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

KEEP EXPLORING

Related papers

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗

Safe Navigation in Cluttered Environments Via Spline-Based Harmonic Potential Fields

We provide a motion-planning framework for target reaching and obstacle avoidance in cluttered environments. Given a polyhedral decomposition of the feasible space, the agent is guided through a prescribed sequence of cells by a suitable control policy. For each cell, we construct a potential induced by a harmonic function on the unit disk whose Dirichlet boundary condition is represented by a cardinal B-spline curve. A detailed analysis of the curve periodicity, support, and control-point selection provides an explicit analytical construction of these potentials and the associated vector fields. We further characterize inter-cell control continuity and forward invariance of non-exit facets, and introduce a smoothed control law ensuring continuous switching between independently constructed neighboring cells. Numerical results illustrate that the resulting framework safely guides the agent along the prescribed cell sequence from the initial point to the target.

eess.SY↗