Low Complexity Eigenmode Selection for MIMO Broadcast Systems with Block Diagonalization
Zhihua Shi
Chunming Zhao
Zhi Ding
Nat. Mobile Commun. Res. Lab., Southeast Univ., Beijing;
This paper appears in: Communications, 2008. ICC '08. IEEE International Conference on
Publication Date: 19-23 May 2008
On page(s): 3976-3981
Location: Beijing,
ISBN: 978-1-4244-2075-9
INSPEC Accession Number: 10041804
Digital Object Identifier: 10.1109/ICC.2008.747
Current Version Published: 2008-05-30
Abstract
We investigate new scheduling algorithms for MIMO broadcast systems to maximize the achievable sum rate of block diagonalization transceivers. In contrast to conventional schemes which select users directly, we investigate a more efficient type of scheduling algorithms, named as multiuser eigenmode transmission (MET). It is based on the selection of eigenmodes of all users. Utilizing an iterative procedure to calculate the Moore-Penrose generalized inverse of a matrix consisting of the already selected eigenmodes, we propose a low complexity multiuser eigenmode selection method based on the greedy algorithm. Then we show that the multiuser dominant eigenmode transmission can achieve the same sum rate scaling law as that of DPC. Therefore, to further reduce the complexity, we restrict our search space to the set of dominant eigenmodes and derive an alternative eigenmode selection algorithm with lower complexity at the cost of little performance loss, which we name as the low-complexity multiuser dominant eigenmode selection algorithm.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
