Skip to Main content Skip to Navigation
Conference papers

Strange bedfellows: Riemann, Gibbs and vector Gaussian multiple access channels

Panayotis Mertikopoulos 1
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG [2007-2015] - Laboratoire d'Informatique de Grenoble [2007-2015]
Abstract : Using tools and techniques from Riemannian geometry, we develop a novel distributed algorithm for optimizing the input signal distribution (and, in particular, its covariance matrix) in Gaussian multiple-input, multiple-output multiple access channels. To account for the problem's semidefiniteness constraints, we endow the space of positive-definitie matrices with a non-Euclidean spectral metric which becomes singular when the signal spectrum itself becomes singular. Quite remarkably, viewing the unit simplex as a subspace of the space of semidefinite matrices (corresponding to diagonal ones), we show that this metric generalizes the well-known Shahshahani metric on the simplex and extends the replicator dynamics of evolutionary game theory; in fact, gradient ascent trajectories defined with respect to this metric are shown to be equivalent to a Gibbs-based exponential learning process. In this way, we show that the resulting optimization algorithm converges to the optimum signal distribution exponentially fast: users attain an ε-neighborhood of the system's optimum configuration in time which is at most O(log(1/ε)) (and, in practice, within only a few iterations, even for large numbers of users).
Complete list of metadatas
Contributor : Arnaud Legrand <>
Submitted on : Wednesday, February 13, 2013 - 3:02:35 PM
Last modification on : Friday, July 17, 2020 - 11:10:23 AM


  • HAL Id : hal-00788010, version 1




Panayotis Mertikopoulos. Strange bedfellows: Riemann, Gibbs and vector Gaussian multiple access channels. NetGCoop'12: Proceedings of the 6th International Conference on Network Games, Control and Optimization, 2012, Unknown. ⟨hal-00788010⟩



Record views