Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function

The word error rate (WER) of soft-decision-decoded binary block codes rarely has closed-form. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for low signal-to-noise ratios and become looser when a suboptimum decoding algorithm is used. This paper proposes a new concept named square radius probability density function (SR-PDF) of decision region to evaluate the WER. Based on the SR-PDF, The WER of binary block codes can be calculated precisely for ML and suboptimum decoders. Furthermore, for a long binary block code, SR-PDF can be approximated by Gamma distribution with only two parameters that can be measured easily. Using this property, two closed-form approximative expressions are proposed which are very close to the simulation results of the WER of interesting.

[1]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[2]  Shlomo Shamai,et al.  Improved upper bounds on the ensemble performance of ML decoded low density parity check codes , 2000, IEEE Communications Letters.

[3]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[4]  Eric W. Weisstein,et al.  The CRC concise encyclopedia of mathematics , 1999 .

[5]  Neil J. A. Sloane,et al.  Techniques of Bounding the Probability of Decoding Error for Block Coded Modulation Structures , 1994 .

[6]  D. Divsalar.  A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .

[7]  Simon Litsyn,et al.  Analysis of low-density parity-check codes based on EXIT functions , 2006, IEEE Transactions on Communications.

[8]  Hesham El Gamal,et al.  Analyzing the turbo decoder using the Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[9]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[10]  John G. Proakis,et al.  Digital Communications , 1983 .

[11]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[12]  Masoud Salehi,et al.  New performance bounds for turbo codes , 1998, IEEE Trans. Commun..

[13]  Shlomo Shamai,et al.  Variations on the Gallager bounds, connections, and applications , 2002, IEEE Trans. Inf. Theory.

[14]  Shu Lin,et al.  Error Control Coding , 2004 .

[15]  I. M. Pyshik,et al.  Table of integrals, series, and products , 1965 .

[16]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[17]  Dariush Divsalar,et al.  Transfer function bounds on the performance of turbo codes Pasadena , 1995 .

[18]  Hamid Jafarkhani,et al.  On the EXIT chart analysis of low-density parity-check codes , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[19]  Shlomo Shamai,et al.  Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum , 2000, IEEE Trans. Inf. Theory.