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

Annales des Telecommunications/Annals of Telecommunications

Volumn 54, Issue 3, 1999, Pages 183-200

  Sason, Igal ^a   Shamai, Shlomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT-OUTPUT WEIGHT ENUMERATION FUNCTION (IOWEF); PARALLEL CONCATENATED TURBO-HAMMING CODES; DECODING; ERROR CORRECTING CODE; ERROR PROBABILITIES; GAUSSIAN CHANNELS; INTERLEAVINGS; ITERATION; MA XIMUM LIKELIHOODS; MAXIMUM-LIKELIHOOD; PERFORMANCE; SOFT DECISION;

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ERROR ANALYSIS; ERROR CORRECTION; FUNCTIONS; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; SPURIOUS SIGNAL NOISE; WHITE NOISE; BIT ERROR RATE; BLOCK CODES; CONCATENATED CODES; ERRORS; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE DECODING; MAXIMUM LIKELIHOOD;

BLOCK CODES; TURBO CODES;

EID: 0032667177     PISSN: 00034347     EISSN: 19589395     Source Type: Journal    
DOI: None     Document Type: Article

References (41)

1. ADDE (P.), PYNDIAH (R.), RAOUL (O.). Performance and complexity of block turbo decoder circuits, Proccedings of the Third IEEE International Conference on Electronics, Circuits and Systems (ICECS '96), pp. 172-175, New-York, USA, (1996).
2. ADDE (P.), PYNDIAH (R.), RAOUL (O.), INISAN (J. R.). Turbo block decoder design, Proceedings of the International Symposium on Turb Codes and Related Topics, pp. 166-169, Brest, France, (3-5 September 1997).
3. AITSAB (O.), PYNDIAH (R.). Performance of Reed-Solomon block turbo code, Proccedings of the IEEE GLOBECOM 1996, pp. 121-125, London, England, (18-21 November 1996).
4. BAHL (L. R.), COCKE (J.), JELINEK (J.), RAVIV (J.). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. on Information Theory, 25, pp. 342-345, (1979).
5. BARBULESCU (S. A.). Iterative decoding of turbo codes and other concatenated codes, Ph.D. dissertation, Faculty of Engineering, University of South Australia, (February 1996).
6. BENEDETTO (S.) MONTORSI (G.). Unveiling turbo codes: some results on parallel concatenated coding schemes, IEEE Trans. on Information Theory, 42, no 2, pp. 409-428, (March 1996).
7. BENEDETTO (S.), DIVSALAR (D.), MONTORSI (G.) POLLARA (F.). Serial concatenation of interleaved codes : performance, analysis, design and iterative decoding, IEEE Trans. on Information Theory, 44, no 3, pp. 909-926, (May 1998).
8. BERROU (C.), EVANO (S.) BATTAIL (G.). Turbo-block-codes. Seminar on Turbo Coding, Lund University, Sweden, (28-29 August 1996).
9. BUCH (G.), BURKERT (F.). Unequal error protection with product-like turbo codes, Proccedings 1998 IEEE International Symposium on Information Theory (ISIT '98), p. 60, MIT Cambridge, MA, USA, (16-21 August 1998).
10. CHENG (J. F.), MCELIECE (R.J.). Unit-memory Hamming turbo codes, Proceedings 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, Canada, (17-22 September, 1995).
11. DIVSALAR (D.), JIN (H.), MCELIECE (R. J.). Coding theorems for turbo-like codes, 1998 Allerton Conference, (23-25 September, 1998).
12. GALLAGER (R.G.). Low density parity check codes, MIT Press, Cambridge, Mass., (1963).
13. GOALIC (A.), PYNDIAH (R.). Real-time turbo-decoding of product codes on a digital signal processor, Proceedings of IEEE Globecom 1997, pp. 624-628, Phoenix. Arizona USA, (3-8 November 1997).
14. GUINAND (P.), LODGE (J.), PAPKE (L.). An alternative approach to the design of interleavers for block-turbo codes, Information Theory and Applications II, 4th Canadian Workshop, Canada, May 1995. Selected Papers : Springer-Verlag, pp. 95-103, Berlin, Germany, (1996).
15. HAGENAUER (J.). OFFER (E.), PAPKE (L.). Iterative decoding of binary block and convolutional codes, IEEE Trans. on Information Theory, 42, no 2, pp. 429-445, (March 1996).
16. HUBER (J.), SCHETELIG (M.), WACHSMANN (U.). Turbo codes over simple block codes and turboproduct codes, Mediterranean Workshop on Coding and Information Integrity, Palma De Mallorca, Spain, (28 February, 1996).
17. KATSMAN (G. L.), TSAFSMAN (M. A.). Spectra of algebraic geometric codes, Problems of Information Transmission, 23, no 1-4, pp. 262-275, (1987).
18. LENTMAIER (M.), ZIGANGIROV (K. Sh.). Iterative decoding of generalized low-density parity-check codes, Proccedings 1998 IEEE International Symposium on Information Theory (ISIT '98), MIT Cambridge, MA, USA, p. 149, (16-21 August 1998).
19. LODGE (J.), YOUNG (R.), HOEHER (P.), HAGENAUER (J.). Separable MAP 'filters'for the decoding of product and concatenated codes, Proccedings of the IEEE International Conference on Communications ICC '93, pp. 1740-1745. Geneva, Switzerland, (23-26 May, 1993).
20. LUCAS (R.). On iterative soft-decision decoding of linear binary block codes, Ph.D. dissertation, Univ. Ulm, Germany, (1997).
21. LUCAS (R.), BOSSERT (M.), BREITBACH (M.). On iterative soft-decision decoding of linear binary block codes and product codes, IEEE Journal on Selected Areas in Communications, 16, no 2, pp. 276-296, (February 1998).
22. MOHER (M.), GULLIVER (T. A.). Cross-entropy and iterative decoding. IEEE Irans. on Information Theory, 44, no 7, pp. 3014-3097, (November 1998).
23. MOORTHY (H. T.), LIN (S.), KASSAMI (T.). Soft decision decoding of binary linear block codes based on iterative search algorithm, IEEE Trans. On Information Theory, 43, no 3, pp. 1030-1039, (May 1997).
24. NICKL (H.), HAGENAUER (J.), BURKERT (F.). Approaching Shannon's capacity limit by 0. 27 dB using simple Hamming codes, IEEE Communications Letters, 1, no 5, pp. 130-132, (September 1997). See also : NICKL (H.), HAGENAUER (J.), BURKERT (F.), The race to Shannon's limit : Discipline high-rate codes, Proceedings of the International Symposium on Turbo Codes and Related Topics, pp. 239-242, Brest, France, (3-5 September 1997).
25. NICKL (H.), HAGENAUER (J.), BURKERT (F.). Approaching Shannon's capacity limit by 0. 27 dB using simple Hamming codes, IEEE Communications Letters, 1, no 5, pp. 130-132, (September 1997). See also : NICKL (H.), HAGENAUER (J.), BURKERT (F.), The race to Shannon's limit : Discipline high-rate codes, Proceedings of the International Symposium on Turbo Codes and Related Topics, pp. 239-242, Brest, France, (3-5 September 1997).
26. PING (L.), CHAN (S.), YEUNG (K. L.). Iterative decoding of multi-dimensional concatenated single parity check codes, Proceedings 1998 IEEE International Conference on Communications, Atlanta, USA, (June 1998).
27. POLTYREV (G.). Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Trans. on Information Theory, 40, no 4, (July 1994). See also : HERZBERG (H.), POLTYREV (G.). The error probability of M-ary PSK block coded modulation schemes. IEEE Trans. on Communications, 44, no 4, pp. 427-433. (April 1996).
28. POLTYREV (G.). Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Trans. on Information Theory, 40, no 4, (July 1994). See also : HERZBERG (H.), POLTYREV (G.). The error probability of M-ary PSK block coded modulation schemes. IEEE Trans. on Communications, 44, no 4, pp. 427-433. (April 1996).
29. PYNDIAH (R.), GLAVIEUX (A.), PICART (A.), JACQ (S.). Near optimum decoding of product codes, Proccedings of IEEE Globecom 1994 Conference, pp. 339-343, San Francisco, USA, (28 November-2nd December, 1994).
30. PYNDIAH (R.), PICART (A.), GLAVIEUX (A.). Performance of block turbo coded 16-QAM and 64-QAM modulations, Proceedings of IEEE Globecom 1995 Conference, pp. 1039-1043, Singapore, (13-17 November 1995).
31. PYNDIAH (R.), COMBELLES (P.), ADDE (P.). A very low complexity block turbo decoder for product codes, Proceedings of IEEE Globecom 1996, pp. 101-105, London, England, (18-22 November 1996).
32. PYNDIAH (R.). Iterative decoding of product codes : block turbo codes, Proceedings of the International Symposium on Turbo Codes and Related Topics, pp. 71-79, Brest, France, (3-5 September 1997).
33. PYNDIAH (R.). Near optimum decoding of product codes : block turbo codes, IEEE Trans. on Communications, 46, no 8, pp. 1003-1010, (August 1998).
34. SASON (I.), SHAMAI (S.) (Shitz). Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum, Technical Report No CC-237, Technion - Israel Institute of Technology, February 1998. To appear in IEEE Trans. on Information Theory. See also : Proccedings 1998 IEEE International Symposium on Information Theory (ISIT '98), p. 30, MIT, Cambridge, MA, USA, (16-21 August 1998).
35. SASON (I.), SHAMAI (S.) (Shitz). Improved upper bounds on the decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum, Technical Report No CC-237, Technion - Israel Institute of Technology, February 1998. To appear in IEEE Trans. on Information Theory. See also : Proccedings 1998 IEEE International Symposium on Information Theory (ISIT '98), p. 30, MIT, Cambridge, MA, USA, (16-21 August 1998).
36. SASON (I.), SHAMAI (S.) (Shitz). Gallager's 1963 bound : Extensions and Observations, Technical Report No CC-258, Techmon. (October 1998).
37. SCHAFFLER (S.), HAGENAUER (J.). Soft decision MAP decoding of binary linear block via global optimization, Proceedings 1997 IEEE International Symposium on Information Theory (ISIT '97), p. 231, Ulm, Germany.
38. SOLJANIN (E.), URBANKE (R.). On the performance of recursive decoding schemes, Proceedings 1997 IEEE International Symposium on Information Theory (ISIT '97), p. 9, Ulm, Germany, See also : Bell Laboratories, Lucent Technologies, Technical Report 1997.
39. SVIRID (Y. V.). Weight distributions and bounds for turbo-codes, European Trans. on Telecommunications (ETT), 6 no 5, pp. 543-555, (Sept.-Oct. 1995).
40. TULHUIZEN (L.), BAGGEN (S.). On the weight enumerator of product codes, Discrete Mathematics, 106/107, pp. 483-488, (1992).
41. TULHUIZEN (L.), BAGGEN (S.), NOWACKA (E. H.), Union bounds on the performance of product codes, Proccedings 1998 IEEE International Symposium on Information Theory (ISIT '98), p. 267, MIT, Cambridge, MA, USA, (16-21 August, 1998).