Distributed MIMO systems for nomadic applications over a symmetric interference channel

Document Type

Article

Publication Date

12-1-2009

Abstract

A single source communicates with a single destination via a remote wireless multiple-antenna (multiple-input multiple-output (MIMO)) transceiver. The source has access to each of the transmit antennas through a finite-capacity link, and likewise the destination is connected to the receiving antennas via capacity-constrained channels (e.g., as for wired or time-division multiple access (TDMA) channels). Targeting a nomadic communication scenario, in which the remote MIMO transceiver is designed to serve different standards or services, it is assumed that transmitters and receivers are oblivious to the encoding function shared by source and destination. Assuming 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 (that holds also for codebook-dependent operation). Closed-form expressions are derived for large numbers of antennas (and in some cases large signal-to-noise ratios (SNRs)), and asymptotics of the achievable rates are studied with respect to either link capacities or SNR. Overall, the analysis points to effective transmission/reception strategies for the distributed MIMO channel at hand, which are optimal under specified conditions. In particular, it is concluded that in certain asymptotic and nonasymptotic regimes there is no loss of optimality in designing the system for nomadic applications (i.e., assuming oblivious transmitters and receivers). Numerical results validate the analysis. © 2009 IEEE.

Identifier

77955600903 (Scopus)

Publication Title

IEEE Transactions on Information Theory

External Full Text Location

https://doi.org/10.1109/TIT.2009.2032730

ISSN

00189448

First Page

5558

Last Page

5574

Issue

12

Volume

55

Grant

ANI-03-38807

Fund Ref

Israel Science Foundation

This document is currently not available here.

Share

COinS