Space-time turbo codes with full antenna diversity

In attempting to find a spectrally and power efficient channel code which is able to exploit maximum diversity from a wireless channel whenever available, we investigate the possibility of constructing a full antenna diversity space-time turbo code. As a result, both three-antenna and two-antenna (punctured) constructions are shown to be possible and very easy to find. To check the decodability and performance of the proposed codes, we derive non-binary soft-decoding algorithms. The performance of these codes are then simulated and compared with two existing space-time convolutional codes (one has minimum worst-case symbol-error probability; the other has maximal minimum free distance) having similar decoding complexity. As the simulation results show, the proposed space-time turbo codes give similar or slightly better performance than the convolutional codes under extremely slow fading. When fading is fast, the better distance spectra of the turbo codes help seize the temporal diversity. Thus, the performance advantage of the turbo codes becomes evident. In particular, 10-5 bit-error rate and 10-3 frame-error rate can be achieved at less than 6-dB Eb/N0 with 1 b/s/Hz and binary phase-shift keying modulation. The practical issue of obtaining the critical channel state information (CSI) is also considered by applying an iteratively filtered pilot symbol-assisted modulation technique. The penalty when the CSI is not given a priori is about 2-3 dB