DocumentCode
1187685
Title
Reduced complexity decoding of space time trellis codes in the frequency selective channel
Author
Turner, Jeremy ; Taylor, Desmond P.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Canterbury, Christchurch
Volume
57
Issue
3
fYear
2009
fDate
3/1/2009 12:00:00 AM
Firstpage
635
Lastpage
640
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.0 dB 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.
Keywords
MIMO communication; Viterbi decoding; iterative decoding; maximum likelihood decoding; space-time codes; trellis codes; MIMO channels; equaliser; frequency selective channel; iterative approach; maximum likelihood decoding; multiple input multiple output channels; partitioned Viterbi algorithm; reduced complexity decoding; soft output Viterbi algorithm; space time trellis codes; Bandwidth; Convolutional codes; Frequency estimation; Intersymbol interference; Iterative decoding; Iterative methods; MIMO; Maximum likelihood decoding; Receiving antennas; Viterbi algorithm; MIMO systems, space-time coding, equalization, reduced complexity, Viterbi;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2009.03.070031
Filename
4799039
Link To Document