Search: (swepub) pers:(Ottersten Björn 1961) lar1:(kth) hsvcat:2
> (2000-2004) >
An Exponential Lowe...
-
Jaldén, Joakim,1976-KTH,Signaler, sensorer och system
(author)
An Exponential Lower Bound on the Expected Complexity of Sphere Decoding
- Article/chapterEnglish2004
Publisher, publication year, extent ...
Numbers
-
LIBRIS-ID:oai:DiVA.org:kth-63596
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-63596URI
-
https://doi.org/10.1109/ICASSP.2004.1326846DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:ref swepub-contenttype
-
Subject category:kon swepub-publicationtype
Notes
-
QC 20120201
-
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.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Ottersten, Björn,1961-KTH,Signaler, sensorer och system(Swepub:kth)u120hb53
(author)
-
KTHSignaler, sensorer och system
(creator_code:org_t)
Related titles
-
In:Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing, s. 393-396
Internet link
To the university's database