Performance of space-time bit-interleaved codes in fading channels with simplified iterative decoding

The performance of space-time bit-interleaved codes over block fading channels is considered. Decoding is based on iterative demapping and decoding. The demapper delivers soft information to the decoder, and accepts feedback from the decoder. Schemes with both soft and hard feedback are described. In particular, we consider the deployment of bit interleaved block/convolutional codes with memoryless mappers. Each block of coded information is transmitted over a number of bursts that experience independent fading. Code design criteria are devised through the analysis of the asymptotic pairwise error probability (i.e., with perfect extrinsic knowledge), and of the maximum attainable diversity bound. Several coding schemes that achieve full asymptotic diversity with convolutional codes of minimum complexity are given. Performance results from simulations show that convergence to the asymptotic error rate curves is achieved