Tight exponential upper bounds on the ml decoding error probability of block codes over fully interleaved fading channels

Abstract

We derive in this paper tight exponential upper bounds on the decoding error probability of block codes which are operating over fully interleaved Rician fading channels, coherently detected and maximum-likelihood decoded. It is assumed that the fading samples are statistically independent and that perfect estimates of these samples are provided to the decoder. These upper bounds on the bit and block error probabilities are based on certain variations of the Gallager bounds. These bounds do not require integration in their final version and they are reasonably tight in a certain portion of the rate region exceeding the cutoff rate of the channel. By inserting inter-connections between these bounds, we show that they are generalized versions of some reported bounds for the binary-input AWGN channel.

On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

“…The joint conditional probability that W d is negative and z exceeds an arbitrary threshold η z when the vector a is perfectly known to the receiver is calculated from (27), (32), (33):…”

Tightened Upper Bounds for Coded FSO Links over Atmospheric Turbulence Channels

“…1(a), we plot the approximate PEP given by (10) and (11) with an error event of length 3 for log-normal and exponential turbulence channels. We also compute the respective exact PEPs and provide them as a reference (illustrated by solid read line).…”

“…The second version of Duman and Salehi (DS2) bound is reported and recognized as one of the most tightest bounding method in fading channel [11], [16]. In what follows, the DS2 bound is generalized to the two atmospheric turbulence channels introduced above.…”

“…), convolutional codes and turbo convolutional codes [7], [8], [11]. In comparison to these codes, turbo product codes (TPCs) appear to be more competitive for their use in optical communication [12].…”

The average weight enumerator and the maximum likelihood performance of product codes

“…Tight bounds on the maximum likelihood codeword error probability of binary linear codes for AWGN and binary symmetric channel (BSC), holding at both low and high SNR, were derived by Poltyrev in [11]. Other bounds such as the Divsalar simple bound and the variations on the Gallager bounds are also tight for AWGN and fading channels [12], [13]. These bounds usually require knowledge of the complete weight enumerator E C (h).…”