A 2Ã\x972 Space-Time Code with Non-Vanishing Determinants and Fast Maximum Likelihood Decoding

Author

Paredes, Javier ; Gershman, Alex B. ; Gharavi-Alkhansari, Mohammad

Author_Institution

Commun. Syst. Group, Darmstadt Univ. of Technol.

Volume

2

fYear

2007

fDate

15-20 April 2007

Abstract

A new 2timesx2 full-rate full-diversity space-time block code (STBC) is proposed that satisfies the non-vanishing determinant property and offers a reduced computational complexity as compared to the other existing full-rate codes. The performance of our new STBC is shown to be comparable to that of the best full-rate STBCs known so far. This performance is achieved at the decoding complexity which is substantially lower than that of the standard sphere decoder.

Keywords

block codes; computational complexity; determinants; matrix algebra; maximum likelihood decoding; space-time codes; STBC; computational complexity; decoding complexity; maximum likelihood decoding; nonvanishing determinants; space-time block code; standard sphere decoder; Block codes; Code standards; Communication systems; MIMO; Maximum likelihood decoding; Rayleigh channels; Receiving antennas; Signal to noise ratio; Space technology; Space time codes; Full-rate full-diversity space-time codes; non-vanishing determinant property; sphere decoder;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on

Conference_Location

Honolulu, HI

ISSN

1520-6149

Print_ISBN

1-4244-0727-3

Electronic_ISBN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2007.366376

Filename

4217549