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
Minimum BER linear transceivers for MIMO channels via primal decomposition
Princeton University, United States.
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Signal Processing.ORCID iD: 0000-0003-2298-6774
2005 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 53, no 8, p. 2866-2882Article in journal (Refereed) Published
Abstract [en]

This paper considers the employment of linear transceivers for communication through multiple-input multiple-output (MIMO) channels with channel state information (CSI) at both sides of the link. The design of linear MIMO transceivers has been studied since the 1970s by optimizing simple measures of the quality of the system, such as the trace of the mean-square error matrix, subject to a power constraint. Recent results showed how to solve the problem in an optimal way for the family of Schur-concave and Schur-convex cost functions. In particular, when the constellations used on the different transmit dimensions are equal, the bit-error rate (BER) averaged over these dimensions happens to be a Schur-convex function, and therefore, it can be optimally solved. In a more general case, however, when different constellations are used, the average BER is not a Schur-convex function, and the optimal design in terms of minimum BER is an open problem. This paper solves the minimum BER problem with arbitrary constellations by first reformulating the problem in convex form and then proposing two solutions. One is a heuristic and suboptimal solution, which performs remarkably well in practice. The other one is the optimal solution obtained by decomposing the convex problem into several subproblems controlled by a master problem (a technique borrowed from optimization theory), for which extremely simple algorithms exist. Thus, the minimum BER problem can be optimally solved in practice with very simple algorithms.

Place, publisher, year, edition, pages
IEEE Signal Processing Society, 2005. Vol. 53, no 8, p. 2866-2882
Keywords [en]
BER, convex optimization theory, decomposition techniques, linear precoder, MIMO channel, transceiver, waterfilling, decision-feedback, optimal designs, precoders, equalization, optimization, information, equalizers, systems
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-14926DOI: 10.1109/TSP.2005.850373ISI: 000230652800022Scopus ID: 2-s2.0-84859826797OAI: oai:DiVA.org:kth-14926DiVA, id: diva2:332967
Note

 QC 20111109

Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-12-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
Palomar, Daniel PèrezBengtsson, MatsOttersten, Björn
By organisation
Signal Processing
In the same journal
IEEE Transactions on Signal Processing
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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