Capacity Optimization of MIMO Links with Interference
Abstract
In this paper, we derive the capacity for MIMO links suffered from cochannel interference where each MIMO link is decomposed via SVD. Then, each eigenchannel of MIMO link is represented by a set of logical links with a set of discrete data rates and discrete powers. An Integer Programming based algorithm (named as IP) is presented to solve the capacity optimization problem. The solution specifies the set of logical links that can transmit simultaneously. Numerical results show that GP and QN methods achieve better performance than IP method for the case of weak interference because of the convexity of the optimization problem when INR is sufficiently small. In the case of strong interference, IP method achieves better performance than GP and QN methods, which means that transmitting one link at a time is better than transmitting all links simultaneously with full power. In other words, scheduling links to transmit is more efficient for the case of strong interference.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 2011
- Accession Number
- ADA562484
Entities
People
- John Matyjas
- Michael Medley
- Peng Wang
Organizations
- Air Force Research Laboratory