On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory

Volumn 42, Issue 4, 1996, Pages 1072-1092

  McEliece, Robert J ^a,b  

^a IEEE

^b California Institute of Technology   (United States)

Author keywords

Block code; Decoding complexity; Trellis; Viterbi algorithm

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; DECODING; MATRIX ALGEBRA; TRELLIS CODES;

LINEAR BLOCK CODES; VITERBI ALGORITHMS;

BLOCK CODES;

EID: 0030195678     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.508834     Document Type: Article

References (44)

1. A. V. Aho, J. E. Hopcroft, and .J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. T. M. Apostel, Calculus, vol. II. New York: Wiley, 1969.
3. 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, 1974.
4. Y. Berger and Y. Be'ery, "Bounds on the trellis size of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 764-773, 1993.
5. _, "Soft trellis-based decoder for linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 203-209, 1994.
6. A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance bounds for binary linear codes/1 IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, Mar. 1993.
7. T. H. Cormen, C. E. Leiscrson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press/McGraw-Hill, 1990.
8. S. Dolinar, L. Ekroot, A. Kiely, R. McEliece, and W. Lin, "The permutation trellis complexity of linear block codes," in Proc. 32nd Allerton Conf. on Communication, Control, and Computing, Oct. 1994, pp. 60-74.
9. Dornhoff and Hohn, Applied Madern Algebra. New York: Macmillan, 1978.
10. G. D. Forney, Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, pp. 268-276, Mar. 1973.
11. _, "Coset codes-Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
12. _, "On dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
13. G. D. Forney, Jr., and M. D. Trott, "The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders," IEEE Trans. Inform. Theory, vol. 39. pp. 1491-1513. Sept. 1993.
14. M. Hall, Jr., Combinatorial Theory. Waltham, MA: Blaisdell, 1967.
15. K. Hoffman and R. Kunze, Linear Algebra. Englewood Cliffs, N.J.: Prentice-Hall, 1961.
16. B. Honary, G. Markarian. and P. Farrell, "Generalized array codes and their trellis structure," Electron. Lett., vol. 29, pp. 541 -542, 1993.
17. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge, UK: Cambridge Univ. Press, 1985.
18. T. Kasami, T. Takala, T. Fuijwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, 1993.
19. _, "On the complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, 1993.
20. A. Kiely, S. Dolinar, R. McEliece, L. Ekroot. and W. Lin, "Trellis decoding complexity of linear block codes," to be published in IEEE Trans. Inform. Theory, vol. 42, 1996.
21. A. D. Kot and C. Leung, "On the construction and dimensionality of linear block code trellises," in Proc. 1993 ISIT, p 291.
22. F. R. Kschischang and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937. Nov. 1995.
23. F. R. Kschischang and G. B. Horn, "A heuristic fnr ordering a linear block code to minimize trellis state complexity," in Proc. 32nd Allerton Conf. on Communication, Control, and Computing, Oct. 1994, pp. 75-84.
24. F. Kschischang and A. Vardy, "Proof of a conjecture of McEliece regarding the optimality of the minimal trellis," IEEE Trans. Inform. Theory, submitted for publication.
25. A. Lafourcade and A. Vardy, "Asymptotically good codes have infinite trellis complexity," to be published in IEEE Trans. Inform. Theory, vol. IT-42, 1996.
26. _, "Lower bounds on trellis complexity of block codes," to be published in IEEE Trans. Inform. Theory, vol. 42, 1996.
27. _, "Optimal sectionalization of a trellis," IEEE Trans. Inform. Theory, vol. 42. pp. 689-703, May 1996.
28. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, UK: Cambridge Univ. Press, 1992.
29. J. L. Massey, "Foundations and methods of channel coding" NTG-Fachberichte (Proc. Int. Conf. on Information Theory and Systems), vol. 65, pp. 148-157, 1978.
30. R. J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
31. R. J. McEliece, R. B. Ash, and C. Ash, Introduction to Discrete Mathematics. New York: Random House, 1989.
32. R. J. McElicce, "The Viterbi decoding complexity of linear block codes," in Proc. Int. Symp. on Information Theory (Trondheim, Norway, June 1994), p. 341.
33. R. J. McEliece and W. Lin, "The trellis complexity of convolutional codes," to be published in Proc. 3rd Int. Symp. on Communication Theory and Applications (Ambleside, UK, July 1995).
34. H. T. Moorthy and S. Lin. "Good nonminimal trellises for linear block codes," submitted to IEEE Trans. Commun.
35. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
36. A. V. Oppenheim, A. S. Willsky, and I. T. Young, Signals and Systems. Englewood Cliffs. N.J.: Prentice-Hall, 1983.
37. G. Solomon, L. H. Oswald, and M. Indurain, "An inefficient trellis representing the words in a block code," Math. Rejecta, in press.
38. V. V. Zyablov and V. R. Siderenko, "Decoding of convolutional codes using a syndrome trellis," IEEE Trans. Inform. Theory, vol. 40, pp. 1663-1666, Sept. 1994.
39. R. P. Stanley. Enumerative Combinatorics, vol. I. Monterey, CA: Wadsworth and Brooks/Cole, 1986.
40. A. Vardy and Y. Be'ery, "Maximum-likelihood soft decision decoding of BCH codes," IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, Mar. 1994.
41. A. J. Viterbi, "Error bounds for convolutionsl codes and an asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269. Apr. 1967.
42. Y -Y. Wang and C.-C. Lu, "The trellis complexity of equivalent binary [17. 9] quadratic residue code is five," in Proc. 1993 Int. Symp. on Information Theory, p. 200.
43. J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes," IEEE. Trans. Inform. Theory, vol. IT-24, pp. 76 80, Jan. 1978.
44. V. V. Zyablov and V. R. Sidereuko, "Bounds on complexity of trellis decoding," Probl. Pered. Inform., vol. 29, no. 3, pp. 1-6, July-Sept. 1993.