Performance of parallel and serial concatenated codes on fading channels

Abstract

The performance of parallel and serial concatenated codes on frequency-nonselective fading channels is considered. The analytical average upper bounds of the code performance over Rician channels with independent fading are derived. Furthermore, the log-likelihood ratios and extrinsic information for maximum a posteriori (MAP) probability and soft-output Viterbi algorithm (SOVA) decoding methods on fading channels are developed. The derived upper bounds are evaluated and compared to the simulated bit-error rates over independent fading channels. The performance of parallel and serial codes with MAP and SOVA iterative decoding methods, with and without channel state information, is evaluated by simulation over independent and correlated fading channels. It is shown that, on correlated fading channels, the serial concatenated codes perform better than parallel concatenated codes. Furthermore, it has been demonstrated that the SOVA decoder has almost the same performance as the MAP decoder if ideal channel state information is used on correlated Rayleigh fading channels.