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
Computational Complexity of Decoding Orthogonal Space-Time Block Codes
(University of California, Irvine)
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-7599-4367
Linköping University, Department of Electrical Engineering, Communication Systems. Linköping University, The Institute of Technology.
2011 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 59, no 4, 936-941 p.Article in journal (Refereed) Published
Abstract [en]

The computational complexity of optimum decoding for an orthogonal space-time block code {cal G}_N satisfying {cal G}_N^H{cal G}_N=c(∑_{k=1}^Kos_ko^2)I_N where c is a positive integer is quantified. Four equivalent techniques of optimum decoding which have the same computational complexity are specified. Modifications to the basic formulation in special cases are calculated and illustrated by means of examples. This paper corrects and extends and unifies them with the results from the literature. In addition, a number of results from the literature are extended to the case c>1.

Place, publisher, year, edition, pages
IEEE Press, 2011. Vol. 59, no 4, 936-941 p.
Keyword [en]
OSTBC, maximum likelihood decoding, quadrature amplitude modulation (QAM), decoding QAM, square QAM
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-60628DOI: 10.1109/TCOMM.2011.012711.090613ISI: 000289808600005OAI: oai:DiVA.org:liu-60628DiVA: diva2:358123
Note
Funding agencies|Center for Pervasive Communications and Computing at the University of California, Irvine||Swedish Research Council (VR)||Swedish Foundation for Strategic Research (SSF)||Knut and Alice Wallenberg Foundation||Available from: 2010-10-20 Created: 2010-10-20 Last updated: 2017-12-12

Open Access in DiVA

fulltext(495 kB)1965 downloads
File information
File name FULLTEXT01.pdfFile size 495 kBChecksum SHA-512
97f7a347f1c14e8b031dff3582b15024a256e4fd224c4b8adddb3950438940e42d0130c0779af734794d921807559f9819bcfba727286c2251c279d31e1367a9
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Larsson, Erik G.Karipidis, Eleftherios

Search in DiVA

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

Search outside of DiVA

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