DocumentCode :
1480989
Title :
Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems
Author :
Tran, Le-Nam ; Bengtsson, Mats ; Ottersten, Björn
Author_Institution :
Signal Process. Lab., KTH R. Inst. of Technol., Stockholm, Sweden
Volume :
60
Issue :
7
fYear :
2012
fDate :
7/1/2012 12:00:00 AM
Firstpage :
3726
Lastpage :
3739
Abstract :
The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser multiple input-multiple output (MIMO) downlink channels, which completely precancels the multiuser interference. Accordingly, the precoder of each user lies in the null space of other users´ channel matrices. In this paper, we propose an iterative algorithm using QR decompositions (QRDs) to compute the precoders. Specifically, to avoid dealing with a large concatenated matrix, we apply the QRD to a sequence of matrices of lower dimensions. One problem of BD schemes is that the number of users that can be simultaneously supported is limited due to zero interference constraints. When the number of users is large, a set of users must be selected, and selection algorithms should be designed to exploit the multiuser diversity gain. Finding the optimal set of users requires an exhaustive search, which has too high computational complexity to be practically useful. Based on the iterative precoder design, this paper proposes a low-complexity user selection algorithm using a greedy method, in which the precoders of selected users are recursively updated after each selection step. The selection metric of the proposed scheduling algorithm relies on the product of the squared row norms of the effective channel matrices, which is related to the eigenvalues by the Hadamard and Schur inequalities. An asymptotic analysis is provided to show that the proposed algorithm can achieve the optimal sum rate scaling of the MIMO broadcast channel. The numerical results show that the proposed algorithm achieves a good trade-off between sum rate performance and computational complexity. When users suffer different channel conditions, providing fairness among users is of critical importance. To address this problem, we also propose two fair scheduling (FS) algorithms, one imposing fairness in the approximation of the data rate, and another directly imposing fairness in the product of the sq- ared row norms of the effective channel matrices.
Keywords :
MIMO communication; channel coding; computational complexity; concatenated codes; eigenvalues and eigenfunctions; greedy algorithms; iterative decoding; matrix algebra; multiuser channels; precoding; radio links; radiofrequency interference; scheduling; BD schemes; FS algorithms; Hadamard inequalities; MIMO broadcast channel; MIMO downlink channels; QR decompositions; QRD; Schur inequalities; asymptotic analysis; block-diagonalized systems; channel conditions; computational complexity; concatenated matrix; data rate approximation; eigenvalues; fair scheduling algorithms; greedy method; iterative precoder design; low-complexity suboptimal precoding technique; low-complexity user selection algorithm; matrices sequence; multiuser diversity gain; multiuser interference precancels; multiuser multiple input-multiple output downlink channels; null space; optimal sum rate scaling; squared row norms; user scheduling; users channel matrices; zero interference constraints; Algorithm design and analysis; Complexity theory; Downlink; Interference; MIMO; Matrix decomposition; Scheduling algorithms; Asymptotic analysis; block diagonalization; downlink channel; fairness scheduling; multiuser multiple input- multiple output (MIMO); user scheduling;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/TSP.2012.2192433
Filename :
6176254
Link To Document :
بازگشت