Bounds on the error performance of coding for nonindependentRician-fading channels

New upper bounds on the error performance of coded systems for Rician channels are presented. The fading channels need not be fully interleaved to obtain meaningful performance results. These bounds hold for coherent, differentially coherent and noncoherent demodulation of binary signals. They provide a useful analytical approach to the evaluation of the error performance of convolutional or block coding and they may be generalized to M-ary signals and trellis modulation. The approach allows for complex bounds using the fine structure of the code, for simpler bounds similar to those on memoryless channels and finally for a random coding bound using the cutoff rate of the channel. The analysis thus permits a step by step evaluation of coded error performances for Rician-fading channels