SwePub
Sök i LIBRIS databas

  Utökad sökning

(swepub) pers:(Ottersten Björn 1961) lar1:(kth) hsvcat:2
 

Sökning: (swepub) pers:(Ottersten Björn 1961) lar1:(kth) hsvcat:2 > (2010-2014) > Iterative Precoder ...

Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems

Tran, Le-Nam (författare)
KTH,Signalbehandling,ACCESS Linnaeus Centre
Bengtsson, Mats, 1967- (författare)
KTH,Signalbehandling,ACCESS Linnaeus Centre
Ottersten, Björn, 1961- (författare)
KTH,ACCESS Linnaeus Centre,Signalbehandling
 (creator_code:org_t)
IEEE Signal Processing Society, 2012
2012
Engelska.
Ingår i: IEEE Transactions on Signal Processing. - : IEEE Signal Processing Society. - 1053-587X. ; 60:7, s. 3726-3739
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • The block diagonalization (BD) scheme is a low-complexity suboptimal precoding technique for multiuser 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 squared row norms of the effective cha- nel matrices.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Nyckelord

Multiuser MIMO
downlink channel
asymptotic analysis
block diagonalization
user scheduling
fairness scheduling.

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy