Graduate School and Research Center in Digital Sciences

Cooperative MIMO precoding with distributed CSI: A hierarchical approach

Atzeni, Italo; Gesbert, David

Submitted to ArXiV, February 27th, 2018

The problem of network multiple-input multipleoutput precoding under distributed channel state information is a notoriously challenging question, for which optimal solutions with reasonable complexity remain elusive. In this context, we assess the value of hierarchical information exchange, whereby an order is established among the transmitters (TXs) in such a way that a given TX has access not only to its local channel estimate but also to the estimates available at the less informed TXs. Assuming regularized zero forcing precoding at the TXs, we propose naive, locally robust, and globally robust suboptimal strategies for the joint precoding design. Numerical results show that the hierarchical information exchange brings significant performance gains, with the locally and globally robust algorithms performing remarkably close to the optimal. Lastly, the cost of hierarchical information exchange relative to the cooperation gain is examined and the optimal tradeoff is numerically evaluated.

Arxiv Bibtex

Title:Cooperative MIMO precoding with distributed CSI: A hierarchical approach
Keywords:Cooperative communications, distributed CSI, limited feedback, network MIMO, robust precoding
Department:Communication systems
Eurecom ref:5488
Copyright: © 2018 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+5488, year = {2018}, title = {{C}ooperative {MIMO} precoding with distributed {CSI}: {A} hierarchical approach}, author = {{A}tzeni, {I}talo and {G}esbert, {D}avid}, booktitle = {{S}ubmitted to {A}r{X}i{V}, {F}ebruary 27th, 2018}, address = {}, month = {02}, url = {} }
See also: