Wireless Link Scheduling Over Recurrent Riemannian Manifolds

Shelim, Rashed; Ibrahim, Ahmed S.

doi:10.1109/tvt.2022.3228212

Cited by 6 publications

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, the geometric perspectives of codebook design utilizing SPD characteristics of correlated channels have been considered in [30], [31]. Riemennian geometry has found application in wireless communication, such as wireless link scheduling in device-to-device networks [32]- [34].…”

Section: A Riemannian Manifolds and Hpd Geometrymentioning

confidence: 99%

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Sadique,

Nasim,

Ibrahim

2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

show abstract

Section: A Riemannian Manifolds and Hpd Geometrymentioning

confidence: 99%