Distributed MIMO Systems with Oblivious Antennas

TL;DR

This paper investigates the capacity of distributed MIMO systems with oblivious antennas, showing that in certain regimes, such systems can achieve optimal rates despite limited knowledge of encoding functions.

Contribution

It introduces a model for distributed MIMO with oblivious antennas and analyzes achievable rates, demonstrating conditions where obliviousness does not reduce optimal performance.

Findings

Oblivious antennas can achieve near-optimal rates in certain regimes.

Finite-capacity links limit but do not necessarily prevent optimal communication.

Theoretical bounds match achievable rates under specific conditions.

Abstract

A scenario in which a single source communicates with a single destination via a distributed MIMO transceiver is considered. The source operates each of the transmit antennas via finite-capacity links, and likewise the destination is connected to the receiving antennas through capacity-constrained channels. Targeting a nomadic communication scenario, in which the distributed MIMO transceiver is designed to serve different standards or services, transmitters and receivers are assumed to be oblivious to the encoding functions shared by source and destination. Adopting a Gaussian symmetric interference network as the channel model (as for regularly placed transmitters and receivers), achievable rates are investigated and compared with an upper bound. It is concluded that in certain asymptotic and non-asymptotic regimes obliviousness of transmitters and receivers does not cause any loss of optimality.