PSP-based decoding for space-time trellis code

Author

Xue, Yisheng ; Zhu, Xuelong

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing, China

fYear

2000

fDate

2000

Firstpage

783

Lastpage

786

Abstract

The problem of adaptive decoding of space-time trellis code (STTC) on the time-variant wireless channels is considered in this paper. We show that the per-survivor processing (PSP) is a straightforward derivation of the practical maximum likelihood sequence detection (MLSD) of STTC when there are no periodically inserted orthogonal pilot symbols (OPS). On this understanding PSP decoders based on Kalman filter and accelerated self-tuning least-mean-square (ASTLMS) algorithm are discussed. Computer simulation results show that all these PSP decoders provide fairly good performance on slowly and moderately fast time-varying channels

Keywords

Kalman filters; adaptive decoding; least mean squares methods; maximum likelihood detection; radio data systems; radio links; time-varying channels; trellis codes; Kalman filter; PSP-based decoding; accelerated self-tuning least-mean-square; adaptive decoding; maximum likelihood sequence detection; per-survivor processing; periodically inserted orthogonal pilot symbols; space-time trellis code; time-variant wireless channels; time-varying channels; Bandwidth; Channel estimation; Channel state information; Computer simulation; Convolutional codes; Fading; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2000. IEEE APCCAS 2000. The 2000 IEEE Asia-Pacific Conference on

Conference_Location

Tianjin

Print_ISBN

0-7803-6253-5

Type

conf

DOI

10.1109/APCCAS.2000.913637

Filename

913637