Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An Exponential Lower Bound on the Expected Complexity of Sphere Decoding
KTH, Tidigare Institutioner (före 2005), Signaler, sensorer och system.ORCID-id: 0000-0001-6630-243X
KTH, Tidigare Institutioner (före 2005), Signaler, sensorer och system.ORCID-id: 0000-0003-2298-6774
2004 (engelsk)Inngår i: Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004, s. 393-396Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
2004. s. 393-396
Emneord [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
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-63596DOI: 10.1109/ICASSP.2004.1326846ISI: 000222179500099Scopus ID: 2-s2.0-4544278544OAI: oai:DiVA.org:kth-63596DiVA, id: diva2:482435
Konferanse
IEEE International Conference on Acoustics, Speech, and Signal Processing, Montreal, CANADA, MAY 17-21, 2004
Merknad

QC 20120201

Tilgjengelig fra: 2012-01-23 Laget: 2012-01-23 Sist oppdatert: 2022-06-24bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Jaldén, JoakimOttersten, Björn

Søk i DiVA

Av forfatter/redaktør
Jaldén, JoakimOttersten, Björn
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 172 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf