Iterative decoding of low-complexity space-time codes

In this work, we study the iterative decoding of a low-complexity space-time architecture proposed by [G. Caire and G. Colavolpe, September 2001; G. Caire and G. Colavolpe, April 2001] employing per-survivor-processing at the receiver with the soft-output Viterbi-algorithm (SOVA, [J. Hagenauer and P. Hoether]). At the transmitter, the space-time architecture is serially concatenated with an outer code. With the availability of extrinsic information at the receiver delivered by the SOVA, it is now possible to use a novel receiver scheme performing iterative (turbo) decoding in order to improve the performance of the architecture. According to the ZF or to the MMSE criterion, linear feedforward and -backward filters of the decision-feedback space-time decoder are derived. Furthermore, the decision metric of the SOVA employing per-survivor-processing is developed and the performance of the scheme is analyzed and compared with the scheme in [G. Caire and G. Colavolpe, April 2001].