# Achieving Vanishing Rate Loss in Decentralized Network MIMO

## TL;DR

This paper demonstrates that in decentralized Network MIMO with asymmetric CSI, it is possible to asymptotically achieve the same sum rate as centralized Zero-Forcing precoding by using a novel, tailored precoding scheme that balances precision and consistency.

## Contribution

It introduces a new precoding scheme for decentralized Network MIMO that achieves asymptotically the same sum rate as centralized systems with perfect CSI.

## Key findings

- Achieves asymptotic sum rate matching centralized Zero-Forcing.
- Introduces a novel precoding scheme tailored for decentralized CSI.
- Shows the rate gap can be eliminated in the high SNR regime.

## Abstract

In this paper, we analyze a Network MIMO channel with 2 Transmitters (TXs) jointly serving 2 users, where each TX has a different multi-user Channel State Information (CSI), potentially with a different accuracy. Recently it was shown the surprising result that this decentralized setting can attain the same Degrees-of-Freedom (DoF) as its genie-aided centralized counterpart in which both TXs share the best-quality CSI. However, the DoF derivation alone does not characterize the actual rate and the question was left open as to how big the rate gap between the centralized and the decentralized settings was going to be. In this paper, we considerably strengthen the previous intriguing DoF result by showing that it is possible to achieve asymptotically the same sum rate as that attained by Zero-Forcing (ZF) precoding in a centralized setting endowed with the best-quality CSI. This result involves a novel precoding scheme which is tailored to the decentralized case. The key intuition behind this scheme lies in the striking of an asymptotically optimal compromise between i) realizing high enough precision ZF precoding while ii) maintaining consistent-enough precoding decisions across the non-communicating cooperating TXs.