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
Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs
University of Oulu, Finland.
University of Oulu, Finland .
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: Communications (ICC), 2012 IEEE International Conference on, IEEE , 2012, 4857-4861 p.Conference paper, Published paper (Refereed)
Abstract [en]

Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal.

Place, publisher, year, edition, pages
IEEE , 2012. 4857-4861 p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-107462DOI: 10.1109/ICC.2012.6364080Scopus ID: 2-s2.0-84871983908ISBN: 978-145772052-9 (print)OAI: oai:DiVA.org:kth-107462DiVA: diva2:575975
Conference
2012 IEEE International Conference on Communications, ICC 2012; Ottawa, ON;10 June 2012 through 15 June 2012
Funder
ICT - The Next Generation
Note

QC 20130116

Available from: 2012-12-11 Created: 2012-12-11 Last updated: 2016-04-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

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
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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