DocumentCode
2060695
Title
Iterative decoding algorithms for I-Q space-time codes
Author
Zummo, Salam A. ; Stark, Wayne E.
Author_Institution
Michigan Univ., MI, USA
fYear
2002
fDate
2002
Firstpage
389
Abstract
I-Q ST codes have shown the potential to provide high coding gains in rapid fading environments. The optimal decoding of I-Q ST codes involves the use of the super-trellis of the I and Q codes, which is complex in general. This paper proposes two iterative decoding algorithms for I-Q ST codes. The proposed algorithms have similar performance to optimal decoding with much lower complexity.
Keywords
fading channels; interference suppression; iterative decoding; space-time codes; trellis codes; I-Q codes; interference cancellation; iterative decoding algorithms; rapid fading environments; space-time codes; super-trellis; Bit error rate; Convolutional codes; Fading; Interference cancellation; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Receiving antennas; Space time codes; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023661
Filename
1023661
Link To Document