Bounds on information combining

IEEE Transactions on Information Theory

Volumn 51, Issue 2, 2005, Pages 612-619

  Land, Ingmar ^a,b   Huettinger, Simon ^c,d   Hoeher, Peter A ^a   Huber, Johannes B ^c  

^a UNIVERSITY OF KIEL   (Germany)

^b AALBORG UNIVERSITY   (Denmark)

^c UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^d SIEMENS AG   (Germany)

Author keywords

Extrinsic information; Extrinsic information transfer (EXIT) chart; Information combining; Information processing characteristic (IPC); Iterative decoding; Mutual information; Parallel concatenated codes

Indexed keywords

CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); ITERATIVE METHODS;

EXTRINSIC INFORMATION TRANSFER (EXIT) CHART; INFORMATION COMBINING; INFORMATION PROCESSING CHARACTERISTIC (IPC); ITERATIVE DECODING; MUTUAL INFORMATION; PARALLEL CONCATENATED CODES;

DATA COMMUNICATION SYSTEMS;

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

References (27)

1. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes", IEEE Trans. Info. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
2. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate", IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 284-287, Mar. 1974.
3. C. R. Hartmann and L. D. Rudolph, "An optimum symbol-by-symbol decoding role for linear codes", IEEE Trans. Inf. Theory, vol. IT-22, no. 5, pp. 514-517, Sep. 1976.
4. G. Battail, M. C. Decouvelaere, and P. Godlewski, "Replication decoding", IEEE Trans. Inf. Theory, vol. IT-25, no. 3, pp. 332-345, May 1979.
5. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes", IEEE Trans. Commun.. vol 44, no. 10, pp. 1261-1271, Oct. 1996.
6. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes", IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
7. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding", IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 909-926, May 1998.
8. R. Gallager, "Low-density parity-check codes", IEEE Trans. Inf. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
9. D. J. MacKay, "Good error-correcting codes based on very sparse matrices", IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
10. R. M. Tanner, "A recursive approach m low complexity codes", IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
11. N. Wiberg, H.-A. Loeliger, and R. Koetter, "Codes and iterative decoding on general graphs", in Proc. IEEE Int. Symp. Information Theory (ISIT), Whistler, BC, Canada, Sep. 1995, p. 468.
12. F. Kschischang, B. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm", IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
13. S. Huettinger, J. Huber, R. Johannesson, and R. Fischer, "Information processing in soft-output decoding", in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2001.
14. S. Huettinger, J. Huber, R. Fischer, and R. Johannesson, "Soft-output-decoding: Some aspects from information theory", in Proc. Int. ITG Conf. Source and Channel Coding, Berlin, Germany, Jan. 2002, pp. 81-90.
15. S. ten Brink, "Convergente behavior of iteratively decoded parallel concatenated codes", IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
16. S. ten Brink, "Code characteristic matching for iterative decoding of serially concatenated codes", Ann. Télécommun., vol. 56, no. 7-8, pp. 394-408, 2001.
17. S. Huettinger and J. Huber, "Performance estimation for concatenated coding schemes", in Proc. IEEE Information Theory Workshop, Paris, France, Mar./Apr. 2003, pp. 123-126.
18. I. Land, S. Huettinger, P. A. Hoehor, and J. Huber, "Bounds on information combining", in Proc. Int. Symp. Turbo Codes and Related. Topics, Brest, France, Sep. 2003, pp. 39-42.
19. I. Sutskover, S. Shamai (Shitz), and J. Ziv, "Extremes of information combining", in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
20. S. Huettinger, "Analysis and design of power-efficient coding schemes", Ph.D. dissertation, Univ. Erlangen-Nümberg, Erlangen, Germany, 2004.
21. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
22. A. D. Wyner and J. Ziv, "A theorem on the entropy of certain binary sequences and applications: Part I", IEEE Trans. Inf. Theory, vol. IT-19, no. 6, pp. 769-772, Nov. 1973.
23. N. Chayat and S. Shamai (Shitz), "Expansion of an entropy property for binary input memoryless symmetric channels", IEEE Trans. Inf. Theory vol. 35, no. 5, pp. 1077-1079, Sep. 1989.
24. P. Robertson, P. Hoeher, and E. Villebrun, "Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding", Europ. Trans. Telecommun., vol. 8, no. 2, pp. 119-125, Mar./Apr. 1997.
25. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output app module for iterative decoding of concatenated codes", IEEE Commun. Lett., vol. 1, no. 1, pp. 22-24, Jan. 1997.
26. J. Huber and S. Huettinger, "Information processing and combining in channel coding", in Proc. Int. Symp. Turbo Codes and Related Topics Brest. France, Sep. 2003, pp. 95-102.
27. A Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions, information functions, support weights, and duality", in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 223-226.