English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this work, we study the problem of the optimal dissemination of channelstate information (CSI) among K spatially distributed transmitters (TXs)jointly cooperating to serve K receivers (RXs). One of the particularities ofthis work lies in the fact that the CSI is distributed in the sense that eachTX obtains its own estimate of the global multi-user MIMO channel with nofurther exchange of information being allowed between the TXs. Although this iswell suited to model the cooperation between non-colocated TXs, e.g., incellular Coordinated Multipoint (CoMP) schemes, this type of setting hasreceived little attention so far in the information theoretic society. We studyin this work what are the CSI requirements at every TX, as a function of thenetwork geometry, to ensure that the maximal number of degrees-of-freedom (DoF)is achieved, i.e., the same DoF as obtained under perfect CSI at all TXs. Weadvocate the use of the generalized DoF to take into account the geometry ofthe network in the analysis. Consistent with the intuition, the derived DoFmaximizing CSI allocation policy suggests that TX cooperation should be limitedto a specific finite neighborhood around each TX. This is in sharp contrastwith the conventional (uniform) CSI dissemination policy which induces CSIrequirements that grow unbounded with the network size. The proposed CSIallocation policy suggests an alternative to clustering which overcomesfundamental limitations such as (i) edge interference and (ii) unboundedincrease of the CSIT requirements with the cluster size. Finally, we show howfinite neighborhood CSIT exchange translates into finite neighborhood messageexchange so that finally global interference management is possible with onlylocal cooperation

Spatial CSIT Allocation Policies for Network MIMO Channels