On a class of non-orthogonal space-time block codes with linear decoding complexity

Author

Dalton, Lori A. ; Georghiades, Costas N.

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

Volume

3

fYear

2003

fDate

6-9 Oct. 2003

Firstpage

1728

Abstract

Orthogonal space-time codes have received attention for having maximum likelihood (ML) receivers that reduce an optimal joint symbol detection problem into a set of single symbol detection problems. In this paper, we introduce a class of space-time block codes, referred to as linear receiver processing (LRP) codes, which have decoupled, linear complexity optimal receivers but are not necessarily orthogonal. These codes are also capable of achieving full diversity and rate. Orthogonal codes may be viewed as a special case of the new LRP codes.

Keywords

block codes; decoding; diversity reception; receivers; space-time codes; joint symbol detection; linear complexity optimal receivers; linear decoding complexity; linear receiver processing code; maximum likelihood receivers; nonorthogonal space-time block code; Antenna theory; Block codes; Detectors; Diversity methods; Maximum likelihood decoding; Maximum likelihood detection; Process design; Receiving antennas; Space time codes; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th

ISSN

1090-3038

Print_ISBN

0-7803-7954-3

Type

conf

DOI

10.1109/VETECF.2003.1285321

Filename

1285321