Metraipolis › archive › dc_8ef5aba7a59b

Finite-Aperture Modeling of Pattern-Reconfigurable Antennas for Multiuser Beamforming — arXiv:2610.09381

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09381
License (as archived)
CC0-1.0
Archived
2026-10-08T14:17:17.076Z
SHA-256 of the archived text
d1b2bff3ee6e0efbfa027a897da86f98e38f4b05a5fc72f4ceccd3629b357c19
Stable URL of this page
https://metraipolis.com/documento/dc_8ef5aba7a59b

How to cite

Finite-Aperture Modeling of Pattern-Reconfigurable Antennas for Multiuser Beamforming — arXiv:2610.09381 — arXiv (en), https://arxiv.org/abs/2610.09381 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8ef5aba7a59b (Metraipolis archive dc_8ef5aba7a59b, sha256 d1b2bff3ee6e0efbfa027a897da86f98e38f4b05a5fc72f4ceccd3629b357c19)
BibTeX
@misc{dc8ef5aba7a59b,
  title = {Finite-Aperture Modeling of Pattern-Reconfigurable Antennas for Multiuser Beamforming — arXiv:2610.09381},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09381},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8ef5aba7a59b; sha256 d1b2bff3ee6e0efbfa027a897da86f98e38f4b05a5fc72f4ceccd3629b357c19},
  year = {2026}
}

Archived text

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

This paper establishes a finite-aperture model for pattern-reconfigurable antennas (PRAs) and exploits its aperture-constrained Fourier representation to develop an efficient multiuser beamforming framework. First, we develop an ideal model by representing the complex radiation pattern using a Fourier series. By applying the Jacobi-Anger expansion, we relate the antenna aperture to the effective Fourier order and derive aperture-dependent power bounds for individual Fourier coefficients. Second, we employ a practical multiport network model and design three representative reconfigurable pixel antennas to verify the predicted effective Fourier orders and per-order power constraints. We then formulate weighted sum-rate maximization for multiuser downlink transmission under both models. Using bounded Fourier coefficients as auxiliary variables, we develop a coefficient-bound penalty-based weighted minimum mean-square error algorithm that separates continuous beamforming from discrete switch-state optimization. We further propose a one-bit neighborhood search that exploits the Sherman-Morrison identity to accelerate the discrete optimization. Simulation results validate the physical relevance of the ideal model and demonstrate multiuser sum-rate gains and reduced optimization runtime for densely switched antennas. The proposed model provides a physically grounded basis for PRA-enabled communication analysis and design, while the framework accommodates different beamforming objectives and PRA implementations.

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/2610.09381 — 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-08T13:28:45.548Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).