Reduced complexity decoding of space time trellis codes in the frequency selective channel

Authors:
Jeremy Turner;Desmond P. Taylor
Affiliations:
Department of Electrical and Computer Engineering, Christchurch, New Zealand;Department of Electrical and Computer Engineering, Christchurch, New Zealand
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 5
Cited 1

The finite-length multi-input multi-output MMSE-DFE

IEEE Transactions on Signal Processing
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Combined array processing and space-time coding

IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications
Simplified processing for high spectral efficiency wireless communication employing multi-element arrays

IEEE Journal on Selected Areas in Communications

The space-time trellis codes with improved performance for fading channels

International Journal of Internet Protocol Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

An iterative approach is developed for decoding Space Time Trellis Codes (STTCs) in frequency selective Multiple Input Multiple Output (MIMO) channels. The method uses the Partitioned Viterbi Algorithm (PVA) as an equaliser for the MIMO system. It is used iteratively with a STTC decoder that provides soft outputs using the Soft Output Viterbi Algorithm (SOVA). It is shown through simulation that the iterative procedure achieves a performance within 2.0dB of Maximum Likelihood (ML) decoding, at a FER of 10-2, but suffers a small diversity loss. It is also shown that the complexity of the iterative approach is lower than that of ML decoding.