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.
2010 (English)In: Proceedings of the IEEE International Conference on Communications (ICC), 2010, 1-6 p.Conference paper, Published paper (Refereed)
Abstract [en]

The computational complexity of optimum decoding for an orthogonal space-time block code 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.

Place, publisher, year, edition, pages
2010. 1-6 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-52559DOI: 10.1109/ICC.2010.5501884ISBN: 978-1-4244-6402-9 (print)OAI: oai:DiVA.org:liu-52559DiVA: diva2:284109
Note
©2010 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. Ender Ayanoglu, Erik G. Larsson and Eleftherios Karipidis, Computational Complexity of Decoding Orthogonal Space-Time Block Codes, 2010, Proceedings of the IEEE International Conference on Communications (ICC), 1-6. http://dx.doi.org/10.1109/ICC.2010.5501884 Available from: 2010-01-04 Created: 2010-01-04 Last updated: 2016-08-31

Open Access in DiVA

fulltext(217 kB)325 downloads
File information
File name FULLTEXT01.pdfFile size 217 kBChecksum SHA-512
6132629f5ba8678ba599709355242a46c61cb7ef63ca39b6f082d73817c24170ecb6c22faf98eaade95ace0b3d6285d68cffc1151c220ec87d4fef7f6ff7f1a0
Type fulltextMimetype application/pdf

Other links

Publisher's full textComputational Complexity of Decoding Orthogonal Space-Time Block Codes

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
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 325 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
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1619 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