Computational Complexity of Decoding Orthogonal Space-Time Block Codes

— 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.

• Type: Journal
• Year: 2011
• Where: TCOM
• Authors: Ender Ayanoglu, Erik G. Larsson, Eleftherios Karipidis
• Keywords: Computational Complexity, Equivalent Techniques, Orthogonal Space-Time Block, TCOM 2011