Change search
ReferencesLink to record
Permanent link

Direct link
Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-6630-243X
2012 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 58, no 9, 5785-5803 p.Article in journal (Refereed) Published
Abstract [en]

In the setting of quasi-static multiple-input multiple-output channels, we consider the high signal-to-noise ratio (SNR) asymptotic complexity required by the sphere decoding (SD) algorithm for decoding a large class of full-rate linear space-time codes. With SD complexity having random fluctuations induced by the random channel, noise, and codeword realizations, the introduced SD complexity exponent manages to concisely describe the computational reserves required by the SD algorithm to achieve arbitrarily close to optimal decoding performance. Bounds and exact expressions for the SD complexity exponent are obtained for the decoding of large families of codes with arbitrary performance characteristics. For the particular example of decoding the recently introduced threaded cyclic-division-algebra-based codes-the only currently known explicit designs that are uniformly optimal with respect to the diversity multiplexing tradeoff-the SD complexity exponent is shown to take a particularly concise form as a non-monotonic function of the multiplexing gain. To date, the SD complexity exponent also describes the minimum known complexity of any decoder that can provably achieve a gap to maximum likelihood performance that vanishes in the high SNR limit.

Place, publisher, year, edition, pages
2012. Vol. 58, no 9, 5785-5803 p.
Keyword [en]
Complexity, diversity multiplexing tradeoff (DMT), large deviations, space-time codes, sphere decoding (SD)
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Computer Science
URN: urn:nbn:se:kth:diva-103141DOI: 10.1109/TIT.2012.2203581ISI: 000307892800011ScopusID: 2-s2.0-84865357206OAI: diva2:559387
ICT - The Next Generation

QC 20121009

Available from: 2012-10-09 Created: 2012-10-04 Last updated: 2013-04-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Jaldén, Joakim
By organisation
Signal ProcessingACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Information Theory
Electrical Engineering, Electronic Engineering, Information EngineeringComputer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 34 hits
ReferencesLink to record
Permanent link

Direct link