An Analytical Method for Approximate Performance Evaluation of Binary Linear Block Codes

IEEE Transactions on Communications

Volumn 52, Issue 2, 2004, Pages 228-235

  Abedi, Ali ^a   Khandani, Amir K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Additive white Gaussian noise (AWGN) channel; Binary phase shift keying (BPSK); Bit decoding; Bit error probability (BEP); Block codes; Log likelihood ratio (LLR); Weight distribution

Indexed keywords

APPROXIMATION THEORY; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; GAUSSIAN NOISE (ELECTRONIC); PHASE SHIFT KEYING; PROBABILITY DENSITY FUNCTION; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE (AWGN) CHANNELS; BINARY PHASE-SHIFT KEYING (BPSK); BIT DECODING; BIT-ERROR PROBABILITY (BEP); LOG-LIKELIHOOD RATIO (LLR); WEIGHT DISTRIBUTION;

BLOCK CODES;

EID: 1642323389     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2003.822704     Document Type: Review

References (37)

1. A. Abedi and A. K. Khandani, "An analytical method for performance analysis of binary linear block codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 403.
2. L. R. Bahl, J. Cocke, F. Jelinek, andJ. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
3. L. Ping and K. L. Yeung, "Symbol-by-symbol decoding of the Golay code and iterative decoding of concatenated Golay codes," IEEE Trans. Inform. Theory, vol. 45, pp. 2558-2562, Nov. 1999.
4. Y. Liu, S. Lin, and M. P. C. Fossorier, "MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams," IEEE Trans. Commun., vol. 48, pp. 577-586, Apr. 2000.
5. S. Riedel, "Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes," IEEE J. Select. Areas Commun., vol. 16, pp. 175-185, Feb. 1998.
6. C. R. P. Hartmann and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
7. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo codes (1)," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
8. J. G. Proakis, Digital Communication, 2nd ed. New York: McGraw-Hill, 1989.
9. S. S. Pietrobon, "On the probability of error of convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1562-1568, Sept. 1996.
10. M. R. Best, M. V. Burnashev, Y. Levy, A. Rabinovich, P. C. Fishburn, A. R. Calderbank, and D. J. Costello, Jr., "On a technique to calculate the exact performance of a convolutional code," IEEE Trans. Inform. Theory, vol. 41, pp. 441-447, Mar. 1995.
11. C. R. P. Hartmann, L. D. Rudolph, and K. G. Mehrotra, "Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel, " IEEE Trans. Inform. Theory, vol. IT-23, pp. 520-522, July 1977.
12. E. Baccarelli, R. Cusani, and G. D. Blasio, "Performance bound and trellis-code design criterion for discrete memoryless channels and finite-delay symbol-by-symbol decoding," IEEE Trans. Commun., vol. 45, pp. 1192-1199, Oct. 1997.
13. D. C. Schleher, "Generalized Gram-Charlier series with application to the sum of log-normal variates," IEEE Trans. Inform. Theory, vol. IT-23, pp. 275-280, Mar. 1977.
14. G. L. Cariolaro and S. G. Pupolin, "Considerations on error probability in correlated-symbol systems," IEEE Trans. Commun., vol. COM-25, pp. 462-467, Apr. 1977.
15. S. Blinnikov and R. Moessner, "Expansions for nearly Gaussian distributions," Astron. Astrophys. Supplement Ser., vol. 130, no. 1, pp. 193-205, May 1998.
16. M. A. Najib and V. K. Prabhu, "Analysis of equal-gain diversity with partially coherent fading signals," IEEE Trans. Veh. Technol., vol. 49, pp. 783-791, May 2000.
17. N. C. Beaulieu, "An infinite series for the computation of the complementary probability distribution of a sum of independent random variables and its application to the sum of Rayleigh random variables," IEEE Trans. Commun., vol. 38, pp. 1463-1474, Sept. 1990.
18. C. Tellambura and A. Annamalai, "Further results on the Beaulieu series," IEEE Trans. Commun., vol. 48, pp. 1774-1777, Nov. 2000.
19. I. T. Monroy and G. Hooghiemstra, "On a recursive formula for the moments of phase noise," IEEE Trans. Commun., vol. 48, pp. 917-920, June 2000.
20. M. Kavehrad and M. Joseph, "Maximum entropy and the method of moments in performance evaluation of digital communications systems," IEEE Trans. Commun., vol. COM-34, pp. 1183-1189, Dec. 1986.
21. A. Abedi, P. Chaudhari, and A. K. Khandani, "On some properties of bit decoding algorithms," in Proc. Canadian Workshop on Information Theory (CWIT 2001), Vancouver, BC, Canada, June 2001, pp. 106-109.
22. H. El-Gamal and A. R. Hammons, Jr., "Analyzing the turbo decoder using the Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 671-686, Feb. 2001.
23. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Select. Areas Commun., vol. 19, pp. 891-907, May 2001.
24. R. S. Freedman, "On Gram-Charlier approximations," IEEE Trans. Commun., vol. COM-29, pp. 122-125, Feb. 1981.
25. M. Abramowitz, Handbook of Mathematical Functions. Washington, DC: U.S. Dept. of Commerce, 1958.
26. J. F. Kenney and E. S. Keeping, Mathematics of Statistics, 2nd ed. Princeton, NJ: Van Nostrand, 1951, pt. 2.
27. A. W. Van der vaart, Asymptotic Statistics. Cambridge, U.K.: Cambridge Univ. Press, 1998.
28. H. Cramer, Mathematical Methods of Statistics. Princeton, NJ: Princeton Univ. Press, 1957.
29. _, Random Variables and Probability Distributions, 3rd ed. Cambridge, U.K.: Cambridge Univ. Press, 1970.
30. _, "On some classes of series used in mathematical statistics, " in Proc. 6th Scandinavian Congr. Mathematicians, Copenhagen, Denmark, 1925, pp. 399-425.
31. E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, 4th ed. Cambridge, U.K.: Cambridge Univ. Press, 1962.
32. G. Szego, Orthogonal Polynomials. Providence, RI: RI Amer. Math. Soc., 1967.
33. P. V. Oneil, Advanced Engineering Mathematics, 4th ed. New York: Thomson, 1995.
34. I. S. Gradshleyn and I. M. Ryzhik, Table of Integrals, Series, and Products, 5th ed. New York: Academic, 1994.
35. T. M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, June 1998.
36. D. Divsalar, "A Simple Tight Bound on Error Probability of Block Codes With Application to Turbo Codes," NASA, JPL, Pasadena, CA, TMO Progress Rep. 42-139, 1999.
37. I. Sason and S. Shamai, "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, Jan. 2000.