Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2298-6774
2012 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, Vol. 60, no 7, 3726-3739 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2012. Vol. 60, no 7, 3726-3739 p.
Keyword [en]
Multiuser MIMO, downlink channel, asymptotic analysis, block diagonalization, user scheduling, fairness scheduling.
National Category
Telecommunications Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-92966DOI: 10.1109/TSP.2012.2192433ISI: 000305578800031Scopus ID: 2-s2.0-84862625997OAI: oai:DiVA.org:kth-92966DiVA: diva2:526517
Funder
ICT - The Next Generation
Note

QC 20120618

Available from: 2012-08-01 Created: 2012-04-09 Last updated: 2013-04-11Bibliographically approved

Open Access in DiVA

fulltext(332 kB)400 downloads
File information
File name FULLTEXT01.pdfFile size 332 kBChecksum SHA-512
47ce0a6f0ebdcf425bbe614c9c4a7e3acdaced80b5f777511758bc0be930b78cf37a294509ce5cf916f6031ba82410f9dbde491ad67ee308bac7422c916a02a9
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Authority records BETA

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
Tran, Le-NamBengtsson, MatsOttersten, Björn
By organisation
Signal ProcessingACCESS Linnaeus Centre
TelecommunicationsSignal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 400 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 120 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf