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
Maximum likelihood detection for the linear MIMO channel
KTH, Superseded Departments, Signals, Sensors and Systems.ORCID iD: 0000-0001-6630-243X
2004 (English)Licentiate thesis, monograph (Other scientific)
Abstract [en]

this thesis the problem of maximum likelihood (ML) detection for the linear multiple-input multiple-output (MIMO) channel is considered. The thesis investigates two algorithms previously proposed in the literature for implementing the ML detector, namely semide nite relaxation and sphere decoding.

The first algorithm, semide nite relaxation, is a suboptimal implementation of the ML detector meaning that it is not guaranteed to solve the maximum likelihood detection problem. Still, numerical evidence suggests that the performance of the semide nite relaxation detector is close to that of the true ML detector. A contribution made in this thesis is to derive conditions under which the semide nite relaxation estimate can be guaranteed to coincide with the ML estimate.

The second algorithm, the sphere decoder, can be used to solve the ML detection problem exactly. Numerical evidence has previously shown that the complexity of the sphere decoder is remarkably low for problems of moderate size. This has led to the widespread belief that the sphere decoder is of polynomial expected complexity. This is however unfortunately not true. Instead, in most scenarios encountered in digital communications, the expected complexity of the algorithm is exponential in the number of symbols jointly detected. However, for high signal to noise ratio the rate of exponential increase is small. In this thesis it is proved that for a large class of detection problems the expected complexity is lower bounded by an exponential function. Also, for the special case of an i.i.d. Rayleigh fading channel, an asymptotic analysis is presented which enables the computation of the expected complexity up to the linear term in the exponent.

Place, publisher, year, edition, pages
2004. , 85 p.
Series
Trita-S3. SB, ISSN 1103-8039 ; 0443
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-498OAI: oai:DiVA.org:kth-498DiVA: diva2:14228
Presentation
(English)
Available from: 2005-11-22 Created: 2005-11-22 Last updated: 2011-11-10Bibliographically approved

Open Access in DiVA

fulltext(574 kB)12854 downloads
File information
File name FULLTEXT01.pdfFile size 574 kBChecksum MD5
9485f2367cc491056b8e67bda689884f249f12e7ead96ff8c69b0b53f06dd88d024df2a1
Type fulltextMimetype application/pdf

Authority records BETA

Jaldén, Joakim

Search in DiVA

By author/editor
Jaldén, Joakim
By organisation
Signals, Sensors and Systems
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 12866 downloads
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

urn-nbn

Altmetric score

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