Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes

Author

Peng, A.Y.-C. ; Il-Min Kim ; Yousefi, Siamak

Author_Institution

Dept. of Electr. & Comput. Eng., Queen´s Univ., Kingston, Ont., Canada

Volume

54

Issue

3

fYear

2006

fDate

3/1/2006 12:00:00 AM

Firstpage

377

Lastpage

382

Abstract

Space-time codes can be decoded by the sphere decoding (SD) algorithm to reduce the complexity and retain maximum-likelihood (ML) performance. In this letter, the ML metric of quasi-orthogonal space-time block codes is written into two independent Euclidean norms, thus SD can be applied to each function independently. The new scheme reduces the complexity by at least 85% for systems with four or more transmit antennas, compared with the conventional SD algorithm.

Keywords

antenna arrays; block codes; matrix algebra; maximum likelihood decoding; space-time codes; transmitting antennas; independent Euclidean norms; low-complexity sphere decoding algorithm; maximum likelihood; quasiorthogonal space-time block codes; transmit antennas; AWGN; Block codes; Constellation diagram; Lattices; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Transmitting antennas; Wireless communication; Bounded distance decoding; codes; maximum-likelihood (ML) decoding; quasi-orthogonal space–time block codes (QOSTBCs); sphere decoding (SD);

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2006.869881

Filename

1605451