On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codes

Conference Record / IEEE Global Telecommunications Conference

Volumn 2, Issue , 2002, Pages 1349-1353

  Zarkeshvari, Farhad ^a   Banihashemi, Amir H ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; ROBUSTNESS (CONTROL SYSTEMS);

LOW-DENSITY PARITY-CHECK (LDPC) CODES;

CODES (SYMBOLS);

EID: 0036967287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. "Concatenated coding techniques and iterative decoding: sailing toward channel capacity," special issue of IEEE J. Selected Areas Comm., vol. 16, no. 2, Feb. 1998.
2. "Codes on graphs and iterative algorithms," special issue of IEEE Trans. Inform. Theory, vol. 47, no. 2, Feb. 2001.
3. "The turbo principle: from theory to practice I," special issue of IEEE J. Selected Areas Comm., vol. 19, no. 5, May 2001.
4. "The turbo principle: from theory to practice II," special issue of IEEE J. Selected Areas Comm., vol. 19, no. 9, Sept. 2001.
5. C. Berrou, A. Glavieux and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding," in Proc. IEEE Int. Conf. Comm. (ICC), pp. 1067-1070,1993.
6. J. Chen and M. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity-check codes," IEEE Tran. Comm., vol. 50, no. 3, pp. 406-414, March 2002.
7. J. Chen and M. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes," IEEE Comm. Lett., vol. 6, no. 5, pp. 208-210, May 2002.
8. J. Chen and M. Fossorier, "Density evolution for BP-based decoding algorithms of LDPC codes and their quantized version," accepted for presentation in IEEE Globcom, 2002.
9. G. D. Forney, Jr., "On iterative decoding and the two-way algorithm," in Proc. Int. Symp. on Turbo Codes and Related Topics, Brest, France, pp. 12-25, Sept. 1997.
10. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. 8, pp. 21-28, Jan. 1962.
11. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646,1996.
12. Y. Mao, A. H. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," Proc. IEEE Int. Conf. on Comm. (ICC), vol. 1, pp. 41-44, 2001.
13. L. Ping, W. K. Leung, "Decoding low-density parity check codes with finite quantization bits," IEEE Comm. Lett., vol. 4, pp. 62 - 64, No. 2, Feb. 2000.
14. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
15. Y. Weiss and W. T. Freeman, "On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 736-744, Feb. 2001
16. F. Zarkeshvari and A. Banihashemi, "On implementation of min-sum algorithm for decoding low-density parity-check codes," submitted to IEEE Trans, on Comm., June 2002.
17. F. Zarkeshvari, "Implementation of iterative decoding algorithms on digital VLSI platforms," M.Sc. dissertation, Carleton Univ., Ottawa, Canada, 2002.