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
Per-Antenna Constant Envelope Precoding and Antenna Subset Selection: A Geometric Approach
KTH, School of Electrical Engineering (EES), Signal Processing. University of Luxembourg.ORCID iD: 0000-0003-2298-6774
Show others and affiliations
2016 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 64, no 23, 6089-6104 p.Article in journal (Refereed) Published
Abstract [en]

Constant envelope (CE) precoding can efficiently control the peak-to-average power ratio (PAPR) and improve the power efficiency of power amplifiers in large-scale antenna array systems. Antenna subset selection (ASS), combined with CE precoding, can further improve power efficiency by using a part of antennas to combine the desired signal. However, due to the inherent nonlinearity, the joint optimization of CE precoding and ASS is very challenging and satisfactory solutions are yet not available. In this paper, we present new methods for CE precoding and ASS optimization from a geometric perspective. First, we show the equivalence between the CE precoder design and a polygon construction problem in the complex plane, thus transforming the algebraic problem into a geometric problem. Aiming to minimize the computational complexity, we further transform the CE precoder design into a triangle construction problem, and propose a novel algorithm to achieve the optimal CE precoder with only linear complexity in the number of used antennas. Then, we investigate the joint optimization of ASS and CE precoding to minimize the total transmit power while satisfying the QoS requirement. Based on the geometric interpretation, we develop an efficient ASS algorithm, which, using only addition and comparison operations, is guaranteed to find the globally optimal solution and provides robustness to channel uncertainty. The complexity of the proposed ASS algorithm is at most quadratic in the number of antennas in the worst case. The optimality and superiority of the proposed geometric methods are demonstrated via numerical results.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016. Vol. 64, no 23, 6089-6104 p.
Keyword [en]
Constant envelope precoding, antenna subset selection, large-scale multi-antenna systems
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-196587DOI: 10.1109/TSP.2016.2582463ISI: 000386232300002ScopusID: 2-s2.0-84994440945OAI: oai:DiVA.org:kth-196587DiVA: diva2:1048258
Note

QC 20161121

Available from: 2016-11-21 Created: 2016-11-17 Last updated: 2016-11-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ottersten, Björn
By organisation
Signal Processing
In the same journal
IEEE Transactions on Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 37 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