Iterative soft-input soft-output decoding of reed-solomon codes by adapting the parity-check matrix

IEEE Transactions on Information Theory

Volumn 52, Issue 8, 2006, Pages 3746-3756

  Jiang, Jing ^a   Narayanan, Krisha R ^a  

^a Texas AandM University   (United States)

Author keywords

Adapting the parity check matrix; Gradient descent; Iterative decoding; Reed Solomon (RS) codes; Soft decision decoding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; DECODING; ITERATIVE METHODS;

GRADIENT DESCENT; HARD-DECISION DECODING; ITERATIVE DECODING; REED-SOLOMON CODES; SOFT-DECISION DECODING;

ENCODING (SYMBOLS);

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

References (35)

1. G. D. Forney Jr., "Generalized minimum distance decoding," IEEE Trans. Inf. Theory, vol. IT-12, no. 2, pp. 125-131, Apr. 1996.
2. D. Chase, "Class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inf. Theory, vol. IT-18, no. 1, pp. 170-182, Jan. 1972.
3. H. Tang, Y. Liu, M. P. C. Fossorier, and S. Lin, "Combining Chase-2 and GMD decoding algorithms for nonbinary block codes," IEEE Commun. Lett., vol. 5, no. 5, pp. 209-211, May 2000.
4. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 49, no. 11, pp. 2809-2825, Nov. 2003.
5. M. El-Khamy, R. J. McEliece, and J. Harel, "Performance enhancements for algebraic soft-decision decoding of Reed-Solomon codes," in Proc. DIMACS, AMS-DIMACS volume on Algebraic Coding Theory and Information Theory.
6. N. Ratnakar and R. Koetter, "Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3899-3917, Nov. 2005.
7. W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, "Toward a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders," J. VLSI Signal Processing, vol. 39, pp. 93-111, Jan./Feb. 2005.
8. A. Vardy and Y. Be'ery, "Bit-level soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 39, no. 5, pp. 440-444, Mar. 1991.
9. V. Ponnampalam and B. Vucetic, "Soft decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 50, no. 11, pp. 1758-1768, Nov. 2002.
10. M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inf. Theory, vol. 41, no. 5, pp. 1379-1396, Sep. 1995.
11. Y. Wu, R. Koetter, and C. Hadjicostis, "Soft-decision decoding of linear block codes using preprocessing," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 259.
12. T. Hu and S. Lin, "An efficient hybrid decoding algorithm for Reed-Solomon codes based on bit reliability," IEEE Trans. Commun., vol. 51, no. 7, pp. 1073-1081, Jul. 2003.
13. M. P. C. Fossorier and A. Valembois, "Reliability-based decoding of Reed-Solomon codes using their binary image," IEEE Commun. Lett., vol. 7, no. 7, pp. 452-454, Jul. 2004.
14. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
15. G. Ungerboeck, "Iterative soft decoding of Reed-Solomon codes," in Proc. Int Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003.
16. J. Jiang and K. R. Narayanan, "Iterative soft decoding of Reed Solomon codes," IEEE Commun. Lett., vol. 8, no. 4, pp. 244-246, Apr. 2004.
17. J. S. Yedidia, "Sparse factor graph representations of Reed-Solomon and related codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 260.
18. J. S. Yedidia, J. Chen, and M. Fossorier, "Generating code representations suitable for belief propagation decoding," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2002.
19. S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications, 1st ed. Englewood Cliffs, NJ: Prentice-Hall, 1983.
20. R. Lucas, M. Bossert, and M. Breitbach, "On iterative soft-decision decoding of linear binary block codes and product codes," IEEE J, Sel. Areas Commun., vol. 16, no. 2, pp. 276-296, Feb. 1998.
21. K. Farrell, L. Rudolph, C. Hartmann, and L. Nielsen, "Decoding by local optimization," IEEE Trans. Inf. Theory, vol. IT-29, no. 5, pp. 740-743, Sep. 1983.
22. R. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
23. R. J. McEliece, D. J. C. MacKay, and J. F. Cheng, "Turbo decoding as an instance of pearl's "belief propagation" algorithm," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 140-152, Feb. 1998.
24. P. Elias, "Coding for two noisy channels," in 3rd London Symp. Information Theory, London, U.K., Sep. 1955.
25. M. P. C. Fossorier, "Reliability-based soft-decision decoding with iterative information set reduction," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3101-3106, Dec. 2002.
26. M. P. C. Fossorier, "Iterative reliability-based decoding of low-density parity check codes," IEEE J. Sel. Areas in Commun., vol. 19, no. 5, pp. 908-917, May 2001.
27. M. E. Khamy and R. J. McEliece, "Iterative algebraic soft decision decoding of Reed-Solomon codes," in Proc. Int. Symp. Information Theory and Its Applications, Parma, Italy, Mar. 2004, pp. 1456-1461.
28. A. Ahmed, R. Koetter, and N. R. Shanbhag, "Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm," in Proc. Asilomar Conf. Signals, Systems, and Computers, Pacific Grove, CA, Nov. 2004, pp. 1995-1999.
29. S. B. Wicker, Error Control Systems for Digital Communication and Storage, 1st ed. Englewood Cliffs, NJ: Prentice-Hall, 1995.
30. W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, "Applications of algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Communi., vol. 54, no. 7, pp. 1224-1234, Jul. 2006.
31. C. Retter, "The average weight-distance enumerator for binary expansions of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 1195-1200, Mar. 2002.
32. D. Divsalar, A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes. TMO Progr. Rep., 1999, TR 42-139.
33. M. E. Khamy and R. J. McEliece, "Bounds on the average binary minimum distance and the maximum likelihood performance of Reed-Solomon codes," in Proc. Allerton, Monticello, IL, Oct. 2004.
34. S. Dolinar, D. Divsalar, and F. Pollara, Code Performance as a Function of Block Size TMO Progress Report, 1998, TR 42-133.
35. W. Jin and M. P. C. Fossorier, "Iterative biased reliability-based decoding of binary linear codes," in Proc. IEICE and SITA Joint Conf. Information Theory, Honolulu, HI, May 2005.