Computer Science – Information Theory
Scientific paper
2010-07-06
Computer Science
Information Theory
30 pages, 8 figures, and 5 tables. Submitted to IEEE Transactions on Signal Processing, Jun. 2010
Scientific paper
We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints, to guarantee the Quality of Service in general MIMO interference networks, which is a combination of multiple interfering broadcast channels (BC) and multiaccess channels (MAC) and is named B-MAC Networks. Two related optimization problems, maximizing the minimum of weighted rates under a sum-power constraint and minimizing the sum-power under rate constraints, are considered. The first approach takes advantage of existing efficient algorithms for SINR problems by building a bridge between rate and SINR through the design of optimal mappings between them. The approach can be applied to other optimization problems as well. The second approach employs polite water-filling, which is the optimal network version of water-filling that we recently found. It replaces most generic optimization algorithms currently used for networks and reduces the complexity while demonstrating superior performance even in non-convex cases. Both centralized and distributed algorithms are designed and the performance is analyzed in addition to numeric examples.
Liu
Liu An
Luo Wu
Xiang Haige
Youjian
No associations
LandOfFree
MIMO B-MAC Interference Network Optimization under Rate Constraints by Polite Water-filling and Duality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with MIMO B-MAC Interference Network Optimization under Rate Constraints by Polite Water-filling and Duality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MIMO B-MAC Interference Network Optimization under Rate Constraints by Polite Water-filling and Duality will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-217331