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 per-antenna power constraint: Optimal and suboptimal 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), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. (Signal Processing)ORCID iD: 0000-0003-2298-6774
2012 (English)In: Communications (ICC), 2012 IEEE International Conference on, IEEE , 2012, 3746-3751 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers the precoder designs for successive zero-forcing dirty paper coding (SZF-DPC), a suboptimal transmission technique for MIMO broadcast channels (MIMO BCs). Existing precoder designs for SZF-DPC often consider a sum power constraint. In this paper, we address the precoder design for SZF-DPC with per-antenna power constraints (PAPCs), which has not been well studied. First, we formulate the precoder design as a rank-constrained optimization problem, which is generally difficult to handle. To solve this problem, we follow a relaxation approach, and prove that the optimal solution of the relaxed problem is also optimal for the original problem. Considering the relaxed problem, we propose a numerically efficient algorithm to find the optimal solution, which exhibits a fast convergence rate. Suboptimal precoder designs, with lower computational complexity, are also presented, and compared with the optimal ones in terms of achievable sum rate and computational complexity.

Place, publisher, year, edition, pages
IEEE , 2012. 3746-3751 p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-107460DOI: 10.1109/ICC.2012.6364222Scopus ID: 2-s2.0-84872001712ISBN: 978-145772052-9 (print)OAI: oai:DiVA.org:kth-107460DiVA: diva2:575977
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 20130118

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: 78 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