Metraipolis › archive › dc_2dee8b463e34

Real Interference Alignment for Active IRS-Aided Systems: A Rate-Profile Learning-Based Approach — arXiv:2608.20007

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.20007
License (as archived)
CC0-1.0
Archived
2026-10-18T12:00:44.254Z
SHA-256 of the archived text
ce9a830a3fb425684c46eca07c50d1d4d223b68a2fd6c4b8452d3956301aa48b
Stable URL of this page
https://metraipolis.com/documento/dc_2dee8b463e34

How to cite

Real Interference Alignment for Active IRS-Aided Systems: A Rate-Profile Learning-Based Approach — arXiv:2608.20007 — arXiv (en), https://arxiv.org/abs/2608.20007 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2dee8b463e34 (Metraipolis archive dc_2dee8b463e34, sha256 ce9a830a3fb425684c46eca07c50d1d4d223b68a2fd6c4b8452d3956301aa48b)
BibTeX
@misc{dc2dee8b463e34,
  title = {Real Interference Alignment for Active IRS-Aided Systems: A Rate-Profile Learning-Based Approach — arXiv:2608.20007},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.20007},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2dee8b463e34; sha256 ce9a830a3fb425684c46eca07c50d1d4d223b68a2fd6c4b8452d3956301aa48b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.20007. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

With additional spatial degrees of freedom provided by the active intelligent reflecting surface (IRS), interference alignment (IA) can be achieved at low cost. In this letter, we propose a real IA scheme for an active IRS-aided system. The proposed scheme only requires the IRS to know the instantaneous channel coefficients under the assumption of blocked direct links. To maximize the achievable sum rate subject to individual minimum rate requirements and transmission power constraints, we propose a rate-profile learning-based algorithm. The algorithm uses offline-trained achievable rate profiles to decouple the original problem into multiple feasibility subproblems, which are then solved by generalized eigenvalue decomposition. Simulation results demonstrate that our proposed algorithm outperforms the conventional weighted minimum mean square error algorithm, while requiring significantly less program execution time.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-21 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.20007 — 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-10-18T11:58:25.123Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).