Summary: Computational Complexity of
Decoding Orthogonal Space-Time Block Codes
Ender Ayanoglu
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
University of California, Irvine
Irvine, CA 92697-2625
Erik G. Larsson and Eleftherios Karipidis
Department of Electrical Engineering
Link¨oping University
SE-581 83 Link¨oping
Sweden
Abstract-- The computational complexity of optimum
decoding for an orthogonal space-time block code is
quantified. Four equivalent techniques of optimum decod-
ing which have the same computational complexity are
specified. Modifications to the basic formulation in special
cases are calculated and illustrated by means of examples.
I. INTRODUCTION
In [1], an optimum Maximum Likelihood metric is in-

Source: Ayanoglu, Ender - Department of Electrical and Computer Engineering, University of California, Irvine

Collections: Engineering