Skip to content

Author

V. Vassiliou

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#graph neural networks Open access Aug 2026

Interference-Calibrated Algebraically Projected Antenna Selection with Certified Graph Learning for Massive MIMO Under Realistic Multi-Cell Impairments

Antenna selection is investigated as a means of reducing radio-frequency (RF) chain power in massive multiple-input multiple-output (MIMO) base stations under realistic channel state information (CSI) impairments. The study is motivated by the mismatch between conventional selection objectives and multi-cell operation with estimation error, pilot contamination, spatial correlation and inter-cell interference. APCS-Boost-R is introduced as the primary contribution. An interference-whitened D-optimal seed is combined with projected rank-one exchanges and a calibrated surrogate that incorporates a user-side interference-plus-noise report and a closed-form estimation-error correction. APCS-Boost-RG is retained as an optional graph neural network (GNN) refinement in which residual exchanges are ranked after the algebraic solution has been formed, while feasibility and non-degradation of the calibrated surrogate are verified deterministically. In a three-cell urban macro configuration derived from Third Generation Partnership Project (3GPP) TR 38.901 with 64 antennas, 16 active RF chains and eight users per cell, APCS-Boost-R achieves 19.364 bit/s/Hz over 200 paired realizations. Improvements of 2.58 percent over APCS-Boost, 6.76 percent over greedy search and 10.16 percent over a genetic algorithm are obtained. APCS-Boost-RG adds 0.019 bit/s/Hz but is treated as an optional refinement because it requires a second-stage neighborhood evaluation and offline model maintenance. In the archived common timing record, APCS-Boost-R requires 20.376 ms per three-cell realization, compared with 12.728 ms for APCS-Boost, 57.775 ms for norm-initialized greedy search and 41.302 ms for the genetic algorithm, while APCS-Boost-RG requires 24.0 ms versus 20.4 ms for APCS-Boost-R in the separate archived learned-stage record. Separate reconstructions on the documented reproducibility host require 55.3±14.5 ms for APCS-Boost-R and 592.2±181.9 ms for a complete APCS-Boost-RG rebuild. Additional paired examinations confirm robustness across stronger search budgets, report imperfections, regularized precoding, coordination, near-field sensitivity, hardware perturbations, and configurations ranging from 32 to 128 antennas and one to seven cells.

Iacovos I. Ioannou, V. Vassiliou · 0 citations