PSP-based decoding for space-time trellis code

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394) pp. 783 - 786
Main Authors Yisheng Xue, Xuelong Zhu
Format Conference Proceeding
LanguageEnglish
Published IEEE 2000
Subjects
Bandwidth
Channel estimation
Channel state information
Computer simulation
Convolutional codes
Fading
Maximum likelihood decoding
Maximum likelihood detection
Receiving antennas
Transmitting antennas
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780780362536
0780362535
DOI:10.1109/APCCAS.2000.913637