Metraipolis › archive › dc_2468975f31ea
Fast and Convergent Alternating GPI Precoding for Self-Backhauled Satellite-Terrestrial Networks — arXiv:2611.07767
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07767
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:59:49.202Z
- SHA-256 of the archived text
cab3937c2c259b0f8adf161060898432068a6b6a336f76b472792cfacc9d3d32- Stable URL of this page
https://metraipolis.com/documento/dc_2468975f31ea
How to cite
Fast and Convergent Alternating GPI Precoding for Self-Backhauled Satellite-Terrestrial Networks — arXiv:2611.07767 — arXiv (en), https://arxiv.org/abs/2611.07767 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2468975f31ea (Metraipolis archive dc_2468975f31ea, sha256 cab3937c2c259b0f8adf161060898432068a6b6a336f76b472792cfacc9d3d32)
BibTeX
@misc{dc2468975f31ea,
title = {Fast and Convergent Alternating GPI Precoding for Self-Backhauled Satellite-Terrestrial Networks — arXiv:2611.07767},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07767},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2468975f31ea; sha256 cab3937c2c259b0f8adf161060898432068a6b6a336f76b472792cfacc9d3d32},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07767. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we propose a precoding framework for an integrated satellite terrestrial self-backhauled (ISTS) system, where a low Earth orbit (LEO) satellite transmits a backhaul stream to an earth station (ES), and the ES forwards its payload to the base station (BS) serving the users. We formulate a user sum spectral efficiency (SE) maximization problem subject to a self-backhaul constraint, which ensures that the user data forwarded by the BS do not exceed the data delivered to the ES. We then reformulate the resulting non-convex precoding problem into a form amenable to generalized power iteration (GPI). The GPI update is reinterpreted as projected preconditioned gradient ascent, revealing that its fixed step size may cause overshooting and non-monotonic behavior. Building on this interpretation, we first develop an alternating convergent GPI (AC-GPI), in which the fixed step is replaced by an Armijo backtracking rule, and show that a single Armijo-accepted step per block already guarantees sufficient ascent. This leads to the fast alternating convergent GPI (FAC-GPI), which performs one Armijo-accepted satellite update followed by one BS update in every round. Unlike existing backtracking-based GPI methods, whose convergence has not been established, we establish finite backtracking termination, monotone ascent, convergence to stationary points, along with a global stationarity-rate guarantee. Simulation results demonstrate stable and fast convergence as well as performance gains over existing methods. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2611.07767 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:41:51.109Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).