Tight bounds on the error probability of coded modulation schemes in Rayleigh fading channels
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A tight upper bound on the bit error performance of coded modulation schemes in Rayleigh fading channels is presented, which has the same simplicity as the union-Chernoff bound while providing closer results to the exact expression.
Abstract
This paper presents a tight upper bound on the bit error performance of coded modulation schemes in Rayleigh fading channels. Upper and lower bounds on the pairwise error probability are first derived. The upper bound is then expressed in a product form to be used with the transfer function bounding technique. This upper bound has the same simplicity as the union-Chernoff bound while providing closer results to the exact expression. Examples for 4-state and 8-state TCM 8PSK schemes are also given to illustrate the tightness and the application of this upper bound.
