Computational Complexity of Decoding Orthogonal Space-Time Block Codes
2010 (English)In: Proceedings of the IEEE International Conference on Communications (ICC), 2010, 1-6 p.Conference paper (Refereed)
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 CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-52559DOI: 10.1109/ICC.2010.5501884ISBN: 978-1-4244-6402-9OAI: oai:DiVA.org:liu-52559DiVA: diva2:284109
©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.