Path partitions and forward-only trellis algorithms

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 38-52

  Ma, Xiao ^a,b   Kavčić, Aleksandar ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Bahl Cocke Jelinek Raviv (BCJR) algorithm; Forward backward algorithm; Forward only algorithm; Markov processes; Sum product algorithm; Trellis graph; Viterbi algorithm

Indexed keywords

ALGORITHMS; CONVOLUTIONAL CODES; DECODING; MARKOV PROCESSES; PROBABILITY; SET THEORY;

FINITE-STATE MACHINES;

TRELLIS CODES;

EID: 0037272109     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806140     Document Type: Article

References (39)

1. A.D. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
2. G. D. Forney, Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-278, Mar. 1973.
3. _, "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inform. Theory, vol. IT-18, pp. 363-378, Mar. 1972.
4. 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.
5. R. W. Chang and J. C. Hancock, "On receiver structures for channels having memory" IEEE Trans. Inform. Theory, vol. IT-12, pp. 463-468, Oct. 1966.
6. L. E. Baum and T. Petrie, "Statistical interference for probabilistic functions of finite state Markov chains," Ann. Math. Statist., vol. 37, pp. 1559-1563, 1966.
7. L. Rabiner, "A tutorial on hidden Markov models and selected areas in speech recognition," Proc. IEEE, vol. 77, pp. 257-286, Feb. 1989.
8. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
9. B. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
10. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Telecommun., vol. 6, pp. 513-526, Sept. 1995.
11. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, Apr. 1996.
12. J. Hagenauer and P. Hoeher, "A Viterbi algorithm with soft-decision outputs and its applications," in Proc. IEEE Global Telecommun. Conf., Dallas, TX, Nov. 1989, pp. 1680-1686.
13. J. Hagenauer and L. Papke, "Decoding 'turbo'-codes with the soft output Viterbi algorithm (SOVA)," in Proc. IEEE Int. Symp. Information Theory, Trondheim, Norway, June 27-July 1, 1994, p. 164.
14. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
15. C. Heegard and S. B. Wicker, Turbo Coding. Boston, MA: Kluwer, 1999.
16. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inform. Theory, vol. 46, pp. 325-343, Mar. 2000.
17. J. Bajcsy and H. Kobayashi, "On obtaining the BCJR algorithm via path counting," in Proc. IEEE Int. Symp. Information Theory and Its Applications, Hawaii, Nov. 2000.
18. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
19. G. D. Forney, Jr., "Codes on graphs: Normal realizations," IEEE Trans. Inform. Theory, vol. 47, pp, 520-548, Feb. 2001.
20. R. J. McEliece, D. J. C. Mackay, and J. F. Cheng, "Turbo decoding as an instance of Pearl's 'belief propagation' algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
21. L.-N. Lee, "Real-time minimal-bit-error probability decoding of convolutional codes," IEEE Trans. Commun., vol. COM-22, pp. 146-151, Feb. 1974.
22. J. F. Hayes, T. M. Cover, and J. B. Riera, "Optimal sequence detection and optimal symbol-by-symbol detection: Similar algorithms," IEEE Trans. Commun., vol. COM-30, pp. 152-157, Jan. 1982.
23. K. Abend and B. D. Fritchman, "Statistical detection for communication channels with intersymbol interference," Proc. IEEE, vol. 58, pp. 779-785, May 1970.
24. Y. Li, B. Vucetic, and Y. Sato, "Optimum soft-output detection for channels with intersymbol interference," IEEE Trans. Inform. Theory, vol. 41, pp. 704-713, May 1995.
25. B. Bai, X. Ma, and X. Wang, "Novel algorithm for continuous decoding of turbo codes," Proc. Inst. Elec. Eng.-Commun., vol. 46, pp. 314-315, Oct. 1999.
26. N. Seshadri and C.-E. W. Sundberg, "List Viterbi decoding algorithms with applications," IEEE Trans. Commun., vol. 42, pp. 313-323, Feb./Mar./Apr. 1994.
27. M. Schmidt and G. P. Fettweis, "On memory redundancy in the BCJR algorithm for nonrecursive shift register processes," IEEE Trans. Inform. Theory, vol. 46, pp. 1580-1584, July 2000.
28. A. Vardy, "Trellis structure of codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, vol. 2.
29. S. Benedetto, D. Divsalar, G. Montrosi, and F. Pollara, "Algorithm for continuous decoding of turbo codes," Electron. Lett., vol. 32, pp. 314-315, Feb. 1996.
30. E. K. Hall and S. G. Wilson, "Stream-oriented turbo codes," IEEE Trans. Inform. Theory, vol. 47, pp. 1813-1831, July 2001.
31. A. Viterbi, "An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes," IEEE J. Select. Areas Commun., vol. 16, pp. 260-264, Feb. 1998.
32. H.-A. Loeliger, "A posteriori probabilities and performance evaluation of trellis codes," in Proc. IEEE Int. Symp. Information Theory, Trondheim, Norway, 1994, p. 335.
33. 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.
34. W. Koch and A. Baier, "Optimum and sub-optimum detection of coded data distributed by time-varying intersymbol interference," in Proc. IEEE GLOBECOM'90, San Diego, CA, Dec. 1990, pp. 1679-1684.
35. P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding," in Europ. Trans. Telecommun., Mar./Apr. 1997, vol. 8, pp. 119-125. Also published in Proc. IEEE ICC'95.
36. M. P. C. Fossorier, F. Burkert, S. Lin, and J. Hagenauer, "On the equivalence between SOVA and max-log-MAP decodings," IEEE Commun. Lett., vol. 2, pp. 137-139, May 1998.
37. V. Franz and J. B. Anderson, "Concatenated decoding with a reduced-search BCJR algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 186-195, Feb. 1998.
38. P. Li and W. K. Leung, "Decoding low density parity check codes with finite quantization bits," IEEE Commun. Lett., pp. 62-64, Feb. 2000.
39. A. Kavčić "On the capacity of Markov sources over noisy channels," in Proc. 2001 IEEE Global Communications Conf., vol. 5, San Antonio, TX, Nov. 2001, pp. 2997-3001.