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
Weighted Sum Rate Maximization for MIMO Broadcast Channels Using Dirty Paper Coding and Zero-forcing Methods
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), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0003-2298-6774
2013 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 61, no 6, 2362-2373 p.Article in journal (Refereed) Published
Abstract [en]

We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power constraint (SPC) and rely on the singular value decomposition (SVD). The SVD-based designs are known to be optimal but require high complexity. We first propose a low-complexity optimal precoder design for SZF-DPC under SPC, using the QR decomposition. Then, we propose an efficient numerical algorithm to find the optimal precoders subject to per-antenna power constraints (PAPCs). To this end, the precoder design for PAPCs is formulated as an optimization problem with a rank constraint on the covariance matrices. A well-known approach to solve this problem is to relax the rank constraints and solve the relaxed problem. Interestingly, for SZF-DPC, we are able to prove that the rank relaxation is tight. Consequently, the optimal precoder design for PAPCs is computed by solving the relaxed problem, for which we propose a customized interior-point method that exhibits a superlinear convergence rate. Two suboptimal precoder designs are also presented and compared to the optimal ones. We also show that the proposed numerical method is applicable for finding the optimal precoders for block diagonalization scheme.

Place, publisher, year, edition, pages
2013. Vol. 61, no 6, 2362-2373 p.
Keyword [en]
MIMO systems, broadcast channels, dirty paper coding, multiuser multi-antenna communication, zero-forcing
National Category
Telecommunications Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-127510DOI: 10.1109/TCOMM.2013.043013.130100ISI: 000321219100024OAI: oai:DiVA.org:kth-127510DiVA: diva2:644479
Funder
EU, European Research Council, 228044
Note

QC 20130830

Available from: 2013-08-30 Created: 2013-08-30 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

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
In the same journal
IEEE Transactions on Communications
TelecommunicationsElectrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 282 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