Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding

Bounds on the error probability ofml decoding for block and turbo-block codes

The performance of either structured or random turbo-block codes and binary, systematic block codes operating over the additive white Gaussian noise (AWGN) channel, is assessed by upper bounds on the error probabilities of maximum likelihood (ML) decoding. These bounds on the block and bit error probability which depend respectively on the distance spectrum and the input-output weight enumerati...

Decoding Error Probability of Binary Linear Block Codes

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...

Upper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels

In this paper, parameterized Gallager’s first bounding technique (GFBT) is presented by introducing nested Gallager regions, to derive upper bounds on the ML decoding error probability of general codes over AWGN channels. The three well-known bounds, namely, the sphere bound (SB) of Herzberg and Poltyrev, the tangential bound (TB) of Berlekamp, and the tangential-sphere bound (TSB) of Poltyrev,...

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

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...

Bounds on the decoding error probability of binary linear codes via their spectra