Iterative decoding algorithms for I-Q space-time codes

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.