Successive relaxation for decoding of LDPC codes

24th Biennial Symposium on Communications, BSC 2008

Volumn , Issue , 2008, Pages 107-110

  Xiao, Hua ^a   Tolouei, Sina ^a   Banihashemi, Amir H ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BACKPROPAGATION; CODES (STANDARDS); CODES (SYMBOLS); DECODING; FOOD ADDITIVES; GAUSSIAN NOISE (ELECTRONIC); LUNAR SURFACE ANALYSIS; MAXIMUM LIKELIHOOD ESTIMATION; STANDARDS; TRELLIS CODES; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; BELIEF PROPAGATION; BINARY INPUTS; DIFFERENT DOMAINS; LDPC CODING; LENGTH CODES; LOG-LIKELIHOOD RATIO; LOW-DENSITY PARITY-CHECK CODES; MIN-SUM; POINT PROBLEM;

ITERATIVE DECODING;

EID: 51849135456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BSC.2008.4563216     Document Type: Conference Paper

References (15)

1. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic Information Transfer Functions: model and erasure channel properties," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
2. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier and X.-Y. Hu, "Reduced-complexity decoding of LDPC codes" IEEE Trans. Comm., vol. 53, no. 8, pp. 1288-1299, August 2005.
3. J. Chen and M. P. C. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Comm., vol. 50, no. 3 , pp. 406-414, March 2002 .
4. T. Etzion, A. Trachtenberg and A. Vardy, "Which codes have cycle-free Tanner graphs?" IEEE Trans. Inform. Theory, vol. 45, pp. 2173-2181, Sept. 1999.
5. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge MA: MIT Press, 1963.
6. S. Hemati and A. H. Banihashemi, "Dynamics and Performance Analysis of Analog Iterative Decoding for Low-Density Parity-Check (LDPC) Codes," IEEE Trans. Comm., vol. 54, no. 1, pp. 61 - 70, Jan. 2006.
7. M. Isaka, M. P. C. Fossorier and H. Imai, "On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representation," IEEE Trans. Comm., vol. 52, pp. 845 - 854, May 2004.
8. D. J. MacKay, "Encyclopedia of sparse graph codes," [online]: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html.
9. Y. Mao and A. H. Banihashemi, "Decoding low-density parity-check codes with probabilistic schedule," IEEE Comm. Letters, vol. 5, no. 10, pp. 414-416, Oct. 2001.
10. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
11. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inform. Theory, vol. 27, no. 9, pp. 533-547, Sept. 1981.
12. N. Wiberg, Codes and Decoding on General Graphs. Ph.D. dissertation, Linköping University, Sweden, 1996, available at: http://www.it.isy.liu.se/publikationer/LIU-TEK-THESIS-440.pdf.
13. H. Xiao and A. H. Banihashemi, "Graph-based message-passing schedules for decoding LDPC codes," IEEE Trans. Comm., vol. 52, no. 12, pp. 2098 - 2105, Dec. 2004.
14. M. R. Yazdani, S. Hemati, and A. H. Banihashemi, "Improving belief propagation on graphs with cycles," IEEE Comm. letters, vol. 8, no. 1, pp.57-59, Jan. 2004.
15. J. Zhao, F. Zarkeshvari and A. H. Banihashemi, "On implementation of min-sum algorithm and its modifications for decoding LDPC codes," IEEE Trans. Comm., vol. 53, no. 4, pp. 549-554, April 2005.