A Fast Algorithm for Designing Grassmannian Constellations

Carlos Beltran (U of Cantabria)

Jan 20. 2022, 14:00 — 14:40

I will discuss a new algorithm for designing Grassmannian constellations, that is, finite collections of points in the complex Grassmannian that maximize mutual chordal distance. This is a fundamental problem in the so-called Noncoherent MIMO Communications. I will introduce the relation to this engnieering problem and describe our approach, which is based on Riemannian optimization in the manifold. The talk will be available to a general mathematician, it is not necesary to have a previous knowledge on Communications. General concepts about Riemannian optimization in quotient manifolds will also be presented.

Joint work with Diego Cuevas, Ignacio Santamaria, Vit Tucek and Gunnar Peters.

Work supported by Grants PID2019-104958RB-C43 and PID2020-113887GB-I00 funded by MCIN/ AEI /10.13039/501100011033, and by Huawei Technologies, Sweden under the project GRASSCOM.

Further Information
ESI Boltzmann Lecture Hall
Associated Event:
Optimal Point Configurations on Manifolds (Workshop)
Christine Bachoc (U Bordeaux)
Henry Cohn (Microsoft, Redmond)
Peter Grabner (TU Graz)
Douglas Hardin (Vanderbilt U, Nashville)
Edward Saff (Vanderbilt U, Nashville)
Achill Schürmann (U of Rostock)
Robert Womersley (UNSW, Sydney)