Analysis and simulation of turbo codes performance over Rice fading channels

Abstract

Abstract-In this work, the performance of turbo codes over the Rice multiplicative fading channel is evaluated through analysis and simulation.The analysis is conducted through improved upper bounds on bit error probabilities in conjunction with both the fully interleaved channel and the correlated Rice slow fading channel. The analytical expression of the improved bound is obtained by extending the results presented in [1] to the Rice multiplicative fading channel case. Simulation results are obtained and presented also for intermediate fading rates, ranging between the two extreme multipath fading rates considered in the analysis. Simulations are performed using the improved Jakes' channel simulator presented in [2] to simulate Rayleigh fading channels, and extended to adequately model the multipath Rice fading propagation environment.

Fixed-Rate Raptor Code Performance Over Correlated Rayleigh Fading Channels

“…In practice, slow fading refers to the case f d T s 0.01, with quasistatic fading being approached when f d T s → 0. Fast fading refers to the case f d T s > 0.01, with uncorrelated (memoryless) fading being approached with f d T s → 1 [11]. The channel loglikelihood ratio (LLR) of each encoded bit, denoted by Z o , can be expressed as:…”