Sökning: (swepub) pers:(Ottersten Björn 1961) lar1:(kth) hsvcat:2
> (2000-2004) >
An Exponential Lowe...
An Exponential Lower Bound on the Expected Complexity of Sphere Decoding
-
- Jaldén, Joakim, 1976- (författare)
- KTH,Signaler, sensorer och system
-
- Ottersten, Björn, 1961- (författare)
- KTH,Signaler, sensorer och system
-
(creator_code:org_t)
- 2004
- 2004
- Engelska.
-
Ingår i: Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing. ; , s. 393-396
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Nyckelord
- Digital communication
- Gaussian noise
- MIMO
- Maximum likelihood decoding
- Maximum likelihood detection
- Maximum likelihood estimation
- Polynomials
- Quadrature amplitude modulation
- Sensor systems
- Signal to noise ratio
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)