An upper bound on turbo codes performance over quasi-static fading channels

摘要

This letter proposes an upper bound on the performance of turbo-codes over quasi-static fading channels. First an upper bound is derived for the case of a single-input single-output channel. The result is then extended to the case of a serial concatenation of a turbo-code and a space-time block code. Unlike a simple extension of the union bound, the derived upper bounds are shown to converge for all signal-to-noise ratios. Additionally the closed form upper bounds obtained confirm analytically that, unlike over additive white Gaussian noise channels, turbo-code performance does not improve by increasing frame length over quasi-static fading channels.