Generalized Union Bound for Space–Time Codes

Abstract

Gallager's second bounding technique, also known as the generalized union bound, is employed to derive a new upper bound on the error probability of space-time codes (STCs) with maximum-likelihood (ML) decoding on quasi-static Rayleigh fading channels. The new bound is distinguished by two characteristics: unlike the classical union bound, the new bound is rapidly convergent and is only a few decibels away from simulation results; and compared with Gallager's first bound, it has better computational efficiency and numerical stability. Hence, the new bound is a useful tool for performance analysis and computer search of good STCs. Moreover, the correlation between fading coefficients is easily accommodated by the new bound. The application of the new bound to convolutional coding on block-fading channels is also demonstrated, and an improved version is derived for the bit-error probability of maximum a posteriori probability decoding