Iterative decoding of space-time trellis codes and related implementation issues

For high data rate transmission over wireless fading channels, space-time trellis coding techniques can be employed to increase the information capacity of the communication system dramatically. In this paper, we consider the scenario of iterative decoding of concatenated space-time trellis codes and convolutional codes. Extra coding gains in addition to the diversity advantage are shown to be achieved for certain space-time trellis codes transmitted over both quasi-static and fast flat fading channels. A prestudy of related VLSI implementation issues is also presented which includes the finite word-length analysis for serial concatenated space-time trellis turbo decoders and hardware saving strategies.