liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Stopping Criterion for Complexity Reduction of Sphere Decoding
SW Jiaotong University.
University of Lancaster.
SW Jiaotong University.
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7599-4367
2009 (English)In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 13, no 6, 402-404 p.Article in journal (Refereed) Published
Abstract [en]

Maximum-likelihood detection in MIMO communications amounts to solving a least-squares problem with a constellation (alphabet) constraint. One popular method that can be used to solve this problem is sphere decoding. We show in this letter that by employing a simple stopping criterion, it is possible to significantly reduce the complexity of sphere decoding over a wide range of SNRs, without a noticeable performance degradation. Specifically, simulation results demonstrate that a 10%-90% reduction of the average complexity could be achieved.

Place, publisher, year, edition, pages
2009. Vol. 13, no 6, 402-404 p.
Keyword [en]
Lattice reduction, MIMO, sphere decoding
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-19623DOI: 10.1109/LCOMM.2009.090112OAI: oai:DiVA.org:liu-19623DiVA: diva2:226728
Note
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Zheng Ma, Bahram Honary, Pingzhi Fan and Erik G. Larsson, Stopping Criterion for Complexity Reduction of Sphere Decoding, 2009, IEEE Communications Letters, (13), 6, 402-404. http://dx.doi.org/10.1109/LCOMM.2009.090112 Available from: 2009-07-03 Created: 2009-07-03 Last updated: 2017-12-13

Open Access in DiVA

fulltext(261 kB)900 downloads
File information
File name FULLTEXT01.pdfFile size 261 kBChecksum SHA-512
bd9955981f79ed557ba51088b343c5acf6e9c7c9ac9f824ae3f12bb457e1244dd76bc039342e53efed59cb1656a1092c1ad349ba62d82a37a58cce21108a76b8
Type fulltextMimetype application/pdf

Other links

Publisher's full textStopping Criterion for Complexity Reduction of Sphere Decoding

Authority records BETA

Larsson, Erik G.

Search in DiVA

By author/editor
Larsson, Erik G.
By organisation
Communication SystemsThe Institute of Technology
In the same journal
IEEE Communications Letters
Engineering and Technology

Search outside of DiVA

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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 1688 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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