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
An Exponential Lower Bound on the Expected Complexity of Sphere Decoding
KTH, Superseded Departments, Signals, Sensors and Systems.ORCID iD: 0000-0001-6630-243X
KTH, Superseded Departments, Signals, Sensors and Systems.ORCID iD: 0000-0003-2298-6774
2004 (English)In: Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004, 393-396 p.Conference paper, Published paper (Refereed)
Abstract [en]

The sphere decoding algorithm is an efficient algorithm used to solve the maximum likelihood detection problem in several digital communication systems. The sphere decoding algorithm has previously been claimed to have polynomial expected complexity. While it is true that the algorithm has an expected complexity comparable to that of other polynomial time algorithms for problems of moderate size it is a misconception that the expected number of operations asymptotically grow as a polynomial function of the problem size. In order to illustrate this point we derive an exponential lower bound on the expected complexity of the sphere decoder.

Place, publisher, year, edition, pages
2004. 393-396 p.
Keyword [en]
Digital communication, Gaussian noise, MIMO, Maximum likelihood decoding, Maximum likelihood detection, Maximum likelihood estimation, Polynomials, Quadrature amplitude modulation, Sensor systems, Signal to noise ratio
National Category
Signal Processing Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-63596DOI: 10.1109/ICASSP.2004.1326846ISI: 000222179500099Scopus ID: 2-s2.0-4544278544OAI: oai:DiVA.org:kth-63596DiVA: diva2:482435
Conference
IEEE International Conference on Acoustics, Speech, and Signal Processing, Montreal, CANADA, MAY 17-21, 2004
Note

QC 20120201

Available from: 2012-01-23 Created: 2012-01-23 Last updated: 2014-12-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Jaldén, JoakimOttersten, Björn

Search in DiVA

By author/editor
Jaldén, JoakimOttersten, Björn
By organisation
Signals, Sensors and Systems
Signal ProcessingTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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