AI 中文总结
研究全双工夹点天线系统FullPASS架构，通过推导信道模型将联合激活问题转化为二元优化，提出两阶段算法求解，仿真表明该方法在候选网格上平均和频谱效率与穷举搜索接近，运行时间大幅减少且适用于更大候选集。
AI 中文摘要
本文提出了FullPASS，一种基于两个平行波导的带内全双工夹点天线系统（PASS）架构。FullPASS收发器可在相同的时频资源上与单个全双工用户终端同时通信，发射波导传输下行链路信号，接收波导收集上行链路信号。候选夹点元件沿两个波导放置，FullPASS收发器联合选择有源发射和接收元件。推导了下行链路、上行链路和发射到接收自干扰路径的基于几何的信道模型。将联合激活问题表述为二元优化问题，以在保持FullPASS接收器处的自干扰泄漏低于规定阈值的同时最大化双向和频谱效率。为此开发了一种两阶段算法来解决非凸组合问题。仿真表明，该方法在13×13和15×15候选网格上的平均和频谱效率与穷举搜索的差距在0.95%以内。在15×15网格上，相对于穷举搜索，平均运行时间减少了一个多数量级，并且仍然适用于更大的候选集。
英文摘要
This paper proposes FullPASS, an in-band full-duplex architecture for pinching-antenna systems (PASSs) based on two parallel waveguides. The FullPASS transceiver simultaneously communicates with a single full-duplex user terminal over the same time-frequency resource: the transmit waveguide delivers the downlink signal, while the receive waveguide collects the uplink signal. Candidate pinching elements are placed along both waveguides, and the FullPASS transceiver jointly selects the active transmit and receive elements. We derive a geometry-based channel model for the downlink, uplink, and transmit-to-receive self-interference paths, including free-space propagation, in-waveguide propagation phase and attenuation, and the attenuation caused by upstream activated elements along each waveguide. The joint activation problem is formulated as a binary optimization that maximizes the bidirectional sum spectral efficiency while keeping the self-interference leakage at the FullPASS receiver below a prescribed threshold. To solve the resulting nonconvex combinatorial problem, we develop a two-stage algorithm. The first stage uses phase-anchored second-order-cone relaxations and deterministic rounding to generate binary trial activation patterns under a simplified propagation model. The second stage applies alternating best-improvement local search with add, remove, and swap operations evaluated under the full propagation model. Simulations show that the proposed method achieves an average sum spectral efficiency within 0.95% of exhaustive search on both the 13-by-13 and 15-by-15 candidate grids. On the 15-by-15 grid, it reduces the average runtime by more than one order of magnitude relative to exhaustive search and remains applicable to substantially larger candidate sets.
CommentsTo be submitted to IEEE for peer-review
