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
The complexity of sphere decoding perfect codes under a vanishing gap to ML performance
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-6630-243X
EURECOM.
2011 (English)In: 2011 IEEE International Symposium on Information Theory Proceedings (ISIT), IEEE , 2011, 2836-2840 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider the complexity of the sphere decoding (SD) algorithm when decoding a class of full rate space-time block codes that are optimal, over the quasi-static MIMO channel, with respect to the diversity-multiplexing tradeoff (DMT). Towards this we introduce the SD complexity exponent which represents the high signal-to-noise ratio (SNR) exponent of the tightest run-time complexity constraints that can be imposed on the SD algorithm while maintaining arbitrarily close to maximum likelihood (ML) performance. Similar to the DMT exposition, our approach naturally captures the dependence of the SD algorithm's computational complexity on the codeword density, code size and channel randomness, and provides simple closed form solutions in terms of the system dimensions and the multiplexing gain.

Place, publisher, year, edition, pages
IEEE , 2011. 2836-2840 p.
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-46338DOI: 10.1109/ISIT.2011.6034092ISI: 000297465103044Scopus ID: 2-s2.0-80054820303ISBN: 978-1-4577-0596-0 (print)ISBN: 978-1-4577-0594-6 (print)OAI: oai:DiVA.org:kth-46338DiVA: diva2:453683
Conference
IEEE International Symposium on Information Theory Proceedings, ISIT 2011. St. Petersburg. 31 July 2011 through 5 August 2011
Note
QC 20111107Available from: 2011-11-03 Created: 2011-11-03 Last updated: 2012-04-03Bibliographically 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
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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