Cooperative Algorithms for MIMO Interference Channels

doi:10.1109/TVT.2010.2085459

2011-01-01

280

Steven W. Peters *

Robert W. Heath

DOI：10.1109/TVT.2010.2085459

原文链接

查看原文

摘要

En 中文

Interference alignment (IA) is a transmission technique for exploiting all available degrees of freedom in the frequency-or time-selective interference channel with an arbitrary number of users. Most prior work on IA, however, neglects interference from other nodes in the network that are not participating in the alignment operation. This paper proposes three generalizations of IA for the multiple-antenna interference channel with multiple users that account for colored noise, which models uncoordinated interference. First, a minimum interference-plus-noise leakage (INL) algorithm is presented and shown to be equivalent to previous subspace methods when noise is spatially white or negligible. This algorithm results in orthonormal precoders that are desirable for practical implementation with limited feedback. A joint minimum mean square error design that jointly optimizes the transmit precoders and receive spatial filters is then proposed, whereas previous designs neglect the receive spatial filter. Finally, a maximum signal-to-interference-plus-noise ratio (SINR) algorithm is developed and proven to converge, unlike previous maximum SINR algorithms. The sum throughput of these algorithms is simulated in the context of a network with uncoordinated cochannel interferers that are not participating in the alignment protocol. It is found that a network with cochannel interference can benefit from employing precoders that are designed to consider that interference, but in extreme cases, such as when only one receiver has a large amount of interference, ignoring that the cochannel interference is advantageous.

Keyword:

Cooperative systems

distributed algorithms

interference channels

multiple-input-multiple-output (MIMO)

wireless communication