Early detection and trellis splicing: Reduced-complexity iterative decoding

IEEE Journal on Selected Areas in Communications

Volumn 16, Issue 2, 1998, Pages 153-159

  Frey, Brendan J ^b,c,d   Kschischang, Frank R ^a,b,e  

^a IEEE

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d Neural Networks Research Group   (United Kingdom)

^e UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; CODING ERRORS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR DETECTION;

EARLY DETECTION; ITERATIVE DECODING ALGORITHMS; TRELLIS SPLICING;

TRELLIS CODES;

EID: 0032001685     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661104     Document Type: Article

References (30)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., 1993.
2. G. Battail, C. Berrou, and A. Glavieux, "Pseudo-random recursive convolutional coding for near-capacity performance," in Proc. IEEE GLOBECOM'93, 1993.
3. J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, "Separable MAP 'filters' for the decoding of product and concatenated codes," in Proc. IEEE Int. Conf. Commun. 1993, pp. 1740-1745.
4. J. D. Anderson, "The TURBO-coding scheme," in Proc. IEEE Int. Symp. Inform. Theory, 1994.
5. J. E. M. Nillson and R. Kötter, "Iterative decoding of product code constructions," in Proc. Int. Symp. Inform. Theory Appl., 1994.
6. P. Jung and M. Nasshan, "Dependence of the error performance of turbocodes on the interleaver structure in short frame transmission systems," Electron. Lett., vol. 30, pp. 287-288, 1994.
7. D. Divsalar and F. Pollara, "Turbo-codes for PCS applications," in Proc. Int. Conf. Commun., 1995, pp. 54-59.
8. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," European Trans. Telecommun., vol. 6, pp. 513-525, Sept./Oct. 1995.
9. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
10. S. Benedetto and G. Montorsi, "Unveiling turbo-codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
11. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996, Due to editing errors, reprinted in Electron. Lett., vol. 33, pp. 457-458, Mar. 1997.
12. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996, Due to editing errors, reprinted in Electron. Lett., vol. 33, pp. 457-458, Mar. 1997.
13. B. J. Frey and F. R. Kschischang, "Probability propagation and iterative decoding," in Proc. 34th Allerton Conf., 1996, [www]. Available: http://www.cs.utoronto.ca/~frey.
14. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Soft-output decoding algorithms in iterative decoding of parallel concatenated convolutional codes," submitted to IEEE Int. Conf. Commun., 1996.
15. B. J. Frey, Graphical Models for Machine Learning and Digital Communication. Cambridge, MA: MIT Press, 1998 [www]. Available: http://www.cs.utoronto.ca/~frey.
16. F. R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," this issue, pp. 219-230; Available: http://www.cs.utoronto.ca/~frey, 1997.
17. R. J. McEliece, D. J. C. MacKay, and J. F. Cheng, "Turbo decoding as an instance of Pearl's 'belief propagation' algorithm," this issue, pp. 140-152.
18. L. Lee, "Concatenated coding systems employing a unit-memory convolutional code and a byte-oriented decoding algorithm," IEEE Trans. Commun., vol. COM-25, pp. 1064-1074, Oct. 1977.
19. O. M. Collins, "Determinate state convolutional codes," IEEE Trans. Commun., vol. 41, pp. 1785-1794, Dec. 1993.
20. J. Hagenauer, E. Offer, and L. Papke, "Improving the standard coding system for deep space missions," in Proc. IEEE Int. Conf. Commun., 1993, pp. 1092-1097.
21. J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan Kaufmann, 1988.
22. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
23. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Dep. Elect. Eng., Linköping Univ., Linköping, Sweden, 1996.
24. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
25. J. F. Cheng, "Iterative decoding," Ph.D. dissertation. Dcp. Elect. Eng., Calif. Inst. Technol., Pasadena, 1997.
26. J. Pearl, "Fusion, propagation, and structuring in belief networks," Artifi. Intell., vol. 29, pp. 241-288, 1986.
27. S. L. Lauritzen and D. J. Spiegelhalter, "Local computations with probabilities on graphical structures and their application to expert systems," J. Roy. Stat. Soc. B, vol. 50, pp. 157-224, 1988.
28. L. E. Baum and T. Petrie, "Statistical inference for probabilistic functions of finite state Markov chains," Ann. Math. Statist., vol. 37, pp. 1559-1563, 1966.
29. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
30. R. J. McEliece, "On the BJCR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, 1996.