ERROR PERFORMANCE OF MPSK TRELLIS-CODED MODULATION OVER NONINDEPENDENT RICIAN FADING CHANNELS

This paper presents new upper bounds on the pairwise error probability (PEP) of trellis-coded modulation (TCM) schemes over nonindependent R ician fading channels. Cases considered are coherent and pilot-tone-ai ded detection and differential detection of trellis-coded multilevel p hase-shift keying (TC-MPSK) systems. The average bit-error probability P-b can be approximated by truncating the union bound. This method do es not necessarily lead to an upper bound on P-b, and, hence, the appr oximation must be used with simulation results. In addition, for Rayle igh fading channels with an exponential autocovariance function, bound s resembling those for memoryless channels have been derived. The boun ds are substantially more accurate than Chernoff bounds and hence allo w for accurate estimation of system performance when the assumption of ideal interleaving is relaxed.