Approximate-min* constraint node updating for LDPC code decoding

Proceedings - IEEE Military Communications Conference MILCOM

Volumn 1, Issue , 2003, Pages 157-162

  Jones, Christopher ^a   Vallés, Esteban ^a   Smith, Michael ^a   Villasenor, John ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GAUSSIAN NOISE (ELECTRONIC); GRAPH THEORY; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; TURBO CODES;

LOG-LIKELIHOOD RATIO (LLR); LOW-DENSITY PARITY-CHECK (LDPC); QUANTIZATION SATURATION LEVELS;

DECODING;

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

References (15)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
3. D. I. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
4. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
5. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity approaching irregular low density parity check codes," IEEE Trans. on Inform. Theory, vol. 47, pp. 618-637, Feb 2001.
6. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1998.
7. T. Tian, C. Jones, J. Villasenor, and R. D. Wesel, "Characterization and selective avoidance of cycles in irregular LDPC code construction," International Conference on Communications (ICC) 2003.
8. J. Chen and M. Fossorier, "Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions," in Prof. IEEE Globecom, Taipei, Taiwan, Nov. 2002.
9. C. Jones, A. Matache, T. Tian, J. Villasenor, and R. Wesel, "LDPC Codes - Universally Good for Wireless Channels," in Proceedings of the Military Communications Conference, Oct 2003.
10. C. Jones, R. Tian, A. Matache, R. Wesel, and J. Villasenor, "Robustness of LDPC Codes on Periodic Fading Channels," in Proceedings of GlobeCom, Nov 2002.
11. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. on Inform. Theory, vol. 47, pp. 638-656, Feb 2001.
12. J. Chen, A. Dholakia, E.Eleftheriou, M. Fossorier, and X.-Y. Hu, "Near optimum reduced-complexity decoding algorithms for LDPC codes," in Proc. IEEE Int. Sym. Inform. Theory, Lausanne, Switzerland, Jul. 2002.
13. E.Eleftheriou, T. Mittelholzer, and A. Dholakia, "A reduced-complexity decoding algorithm for low-density parity-check codes," IEE Electron. Letters, vol. 37, pp. 102-104, Jan. 2001.
14. J. Chen and M. Fossorier, "Near optimum universal belief propagation based decoding of LDPC codes," IEEE Trans. on Comm., vol. 50, no. 3, Mar. 2002.
15. L. Dong-U, J. Villasenor, and W. Luk, "A hardware Gaussian noise generator for exploring channel code behavior at very low bit error rates," in In proceedings of FCCM, May 2003.