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
Fundamental rate-reliability-complexity limits in outage limited MIMO communications
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-6630-243X
2010 (English)In: IEEE International Symposium on Information Theory - Proceedings, 2010, 2203-2207 p.Conference paper, Published paper (Refereed)
Abstract [en]

The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regime, the limits are optimized over all encoders, all decoders, and all complexity regulating policies. The work then proceeds to explicitly identify encoder-decoder designs and policies, that meet this optimal tradeoff. In practice, the limits aim to meaningfully quantify different pertinent and interrelated measures, such as the optimal rate-reliability capabilities per unit complexity and power, the optimal diversity gains per complexity costs, or the optimal goodput per flop. Finally the tradeoff's simple nature, renders it useful for insightful comparison of the rate-reliability-complexity capabilities for different encoders-decoders.

Place, publisher, year, edition, pages
2010. 2203-2207 p.
Series
IEEE International Symposium on Information Theory
Keyword [en]
Complexity, Diversity-multiplexing tradeoff, Fundamental limits, Lattice reduction, Multiple-input multiple-output (MIMO), Regularization, Space-time coders-decoders, Diversity-multiplexing trade-off, Multiple-input-multiple-output, Communication channels (information theory), Decoding, MIMO systems, Multiplexing, Optimization, Outages, Quality assurance, Reliability, Computational complexity
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-35641DOI: 10.1109/ISIT.2010.5513479ISI: 000287512700443Scopus ID: 2-s2.0-77955671949ISBN: 978-1-4244-6960-4 (print)OAI: oai:DiVA.org:kth-35641DiVA: diva2:429575
Conference
2010 IEEE International Symposium on Information Theory Austin, TX, JUL 13, 2010
Note
QC 20110705Available from: 2011-07-05 Created: 2011-07-04 Last updated: 2011-11-21Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Jaldén, Joakim

Search in DiVA

By author/editor
Jaldén, Joakim
By organisation
Signal ProcessingACCESS Linnaeus Centre
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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