A computationally efficient algorithm for space-time block decoding

Author

Cavus, Enver ; Daneshrad, Babak

Author_Institution

Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA

Volume

4

fYear

2001

fDate

2001

Firstpage

1157

Abstract

This paper presents a computationally efficient, low-power algorithm for the decoding of space-time block codes using a previously reported maximum likelihood algorithm (Tarokh et al. 1998). The new algorithm arrives at the same decision with less computation, and therefore reduces power dissipation for an actual implementation. Based on the previous algorithm, we develop a more efficient algorithm by utilizing the properties of the constellation signals and reported decision metrics. In most cases, the new algorithm results in more than 50% reduction in the computation complexity. The algorithm is illustrated for BPSK, QPSK, PSK or QAM

Keywords

block codes; computational complexity; decoding; modulation coding; quadrature amplitude modulation; quadrature phase shift keying; ASIC design; BPSK; PSK; QAM; QPSK; computation complexity; computationally efficient algorithm; constellation signals; power dissipation; reported decision metrics; space-time block decoding; transmit diversity; Application specific integrated circuits; Block codes; Constellation diagram; Degradation; Fading; Hardware; Maximum likelihood decoding; Power dissipation; Power engineering computing; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.936850

Filename

936850