Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes

IEE Proceedings: Communications

Volumn 147, Issue 6, 2000, Pages 322-332

  Esmaeili, M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; GRAPH THEORY; MAXIMUM LIKELIHOOD ESTIMATION;

ACYCLIC TANNER GRAPHS; MAXIMUM LIKELIHOOD DECODING;

BLOCK CODES;

EID: 0034472728     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:20000663     Document Type: Article

References (36)

1. BAHL, L.R., COCKE, J., JELINEK, F., and RAVIV, J.: 'Optimal decodins of linear codes for minimizing symbol error rate', IEEE Trans. Inf. Theory. 1974, IT-20, pp. 284-287
2. FORNEY, G.D.: 'Coset codes part II: binary lattices and related codes", IEEE Traits. Inf. Tlieory. 1988, IT-34, pp. 1152-1187
3. WOLF, J.K.: 'Maximum likelihood decoding of linear block codes using a trellis', IEEE Trims. Inf. Tlicory, 1978, IT-24, pp. 76-80
4. TANNER, R.M.: 'A recursive approach to low complexity codes', IEEE Tram. Inf. Theory, 1981, IT-27, pp. 533-547
5. WIBERG, N., LOELIGER, H.-A., and KOTTER, R.: 'Codes and iterative decoding on general graphs', Ettr. Traits. Telecoinnnm., 1995, 6, pp. 515-526
6. WIBERG, N.: 'Codes and decoding on general graphs'. PhD thesis, University of Linkoping, Sweden, 1996
7. MUDER, D.: 'Minimal trellises for block codes', IEEE Trims. Inf. Theory, 1988, IT-34, (5), pp. 1049-1053
8. HONARY, B., MARKARIAN, G., and DARNELL, M.: 'Lowcomplexity trellis decoding of linear block codes', IEE Proc. Commun., 1995,142, (4), pp. 201-209
9. HORN, G.B., and KSCHISCHANG, F.R.: 'On the intractability of permuting a block code to minimize trellis complexity', IEEE Trans. Inf. Theory, 1996, 42, (6), pp.
10. KSCHISCHANG, F.R., and SOROKINE, V.: 'On the trellis structure of block codes', IEEE Trans. Inf. Theorv. 1995, 41, (6), pp. 19241937
11. SIDORENKO, G., MARKARIAN, and HONARY, B.: 'Minimal trellis desicn for linear codes based on the Shannon product', IEEE Trans. Iiif~ Tlieory, 1996, 42, (6), pp. 2048-2053
12. CHARBIT, G., MANÇUKIAN, H., and HONARY, B.: 'Array codes over rincs and their trellis decoding', IEE Proc. Commun., 1996, 143, (5), pp. 241-246
13. HONARY, B., KAYA, L., MARKARIAN, G., and DARNELL, M.: 'Maximum-likelihood decoding of array codes with trellis structure', IEE Proc. I, 1993, 140, (5), pp. 340-346
14. CONWAY, J.H., and SLOANE, N.J.A.: 'Decoding techniques for codes and lattices, including the Golay code and the Leech lattice', IEEE Trans. Inf. Tlieory, 1986, IT-32, pp. 41-50
15. PLESS, V.: 'Decoding the Golay code', IEEE Trans. Inf. Tlieory, 1986, IT-32, pp. 561-567
16. RAN, M., and SNYDERS, J.: 'Constrained designs for maximum likelihood soft decoding of RM(2,m) and the extended Golay codes', IEEE Trans. Commun., 1995,43, (2-4), pp. 812-820
17. SNYDERS, J., and BE'ERY, Y.: 'Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes', IEEE Trans. Inf. Tlieory, 1989, 35, (5), pp. 963-975
18. VARDY, A., and BE'ERY, Y.: 'More efficient soft decoding of the Golay codes', IEEE Trans. Inf. Tlieory. 1991, IT-37, pp. 667-672
19. YUAN.J., CHEN, C.S., and MA, S.: Two-level decoding of (32,16,8) quadratic residue code', IEE Proc. I, 1993, 140, (6), pp. 409414
20. SILVERMAN, R.A., and BALSER, M.: 'Coding for a constant data rate source', IRE Trims. Inf. Theory, 1954, PG IT-4, pp. 50-63
21. ABBASZADEH, A.D., and RUSHFORTH, C.K.: 'Efficient maximum-likelihood decoding of the extended Nordstrom-Robinson code'. Proceedings of 25th annual Allerton conference, 1987, pp. 598-599
22. BERLEKAMP, E.R.: 'The technology of error correcting codes', Proc. IEEE, 1980, 68, pp. 564-593
23. BERLEKAMP, E.R.: "The construction of fast, hiah-rate, soft decision block decoders', IEEE Trum. Inf. Tlicory, 1983, IT-29, pp. 372377
24. CHASE, D.: 'A class of algorithms for decoding block codes with channel measurement information', IEEE Trims. Inf. Tlicory, 1972, IT-18, pp. 170-182
25. CONWAY, J.H., and SLOANE, N.J.A.: 'Fast quantizing and decoding algorithms for lattice quantizers and codes', IEEE Trims. Inf. Theory, 1982, IT-28, pp. 227-232
26. FORNEY, G.D. Jr.: 'Concatenated codes' (MIT Press, Cambridge, MA, 1966), pp. 61-62
27. FORNEY, G.D.: 'Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference', IEEE Trans. Inf. Tlicory. 1972, IT-18, pp. 363-378
28. FORNEY, G.D.: 'Coset codes part III: ternary codes, lattices, and trellis codes', IEEE unpublished paper, 1987
29. ETZION.T., TRACHTENBERG, A., and VARDY, A.: 'Which codes have cycle-free Tanner graphs?', 1997, (Preprint)
30. HARARY, F.: 'Graph theory' (Addison-Wesley, New York, 1972)
31. ESMAEILI, M., and KHANDANI, A.K.: 'Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes'. Technical Report UW-E&CE#9S-01, Department of Electrical and Computer Engineering; University of Waterloo, Waterloo, Canada, 1998
32. MACWILLIAMS, F.J., and SLOANE, N.J.A.: 'The theory of errorcorrecting codes' (North Holland, Amsterdam, 1977)
33. LAFOURCADE, A., and VARDY, A.: 'Optimal scctionalization of a trellis', IEEE Trims. Inf. Theory, 1996,42, (3), pp. 689-703
34. FOSSORIER, M.P.C., and L1N, S.: 'Computationally efficient softdecision decoding of linear block codes based on ordered statistics', IEEE Trans. Inf. Tlicory, 1996, 42, pp. 738-750
35. FOSSORIER, M.P.C., and LIN, S.: 'Generalized coset decoding', IEEE Trims. Commun., 1997, 45, pp. 393-395
36. FOSSORIER, M.P.C., and LIN, S.: 'Chase-type and GMD coset dccodings', IEEE Trims. Commun., 2000,48, pp. 345-350