Decoding algorithms based on oscillation for low-density parity check codes

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 8, 2005, Pages 2216-2226

  Gounai, Satoshi ^a,c   Ohtsuki, Tomoaki ^b,c,d  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

^b KEIO UNIVERSITY   (Japan)

^c IEEE   (Japan)

^d Sita Messtechnik GmbH   (Germany)

Author keywords

Log likelihood ratio belief propagation; Low density parity check code; Ordered statistic decoding; Oscillation

Indexed keywords

ALGORITHMS; BIT ERROR RATE; CIRCUIT OSCILLATIONS; DECODING; PROBABILITY;

LOG LIKELIHOOD RATIO BELIEF PROPAGATION; LOW-DENSITY PARITY-CHECK CODE; ORDERED STATISTIC DECODING; OSD ALGORITHM;

BINARY CODES;

EID: 26044449403     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e88-a.8.2216     Document Type: Conference Paper

References (13)

1. R.G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol.IT-8, pp.21-28, Jan. 1962.
2. R.G. Gallager, Low-density parity-check codes, M.I.T. Press, Cambridge, MA, 1963.
3. 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, Aug. 1996.
4. D.J.C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol.45, no.2, pp.399-431, March 1999.
5. G. Lechner and J. Sayir, "On the convergence of log-likelihood values in iterative decoding," Mini-Workshop on Topics in Information Theory, Sept. 2002.
6. G. Lechner, "Convergence of sum-product algorithm for finite length low-density parity-check codes," Winter School on Coding and Information Theory, Monte Verita, Switzerland, Feb. 2003.
7. G. Lechner, Convergence of sum-product algorithm for short low-density parity check code, Diploma Thesis, Technical University of Vienna, Austria, April 2003.
8. M. Fossorier, "Iterative reliability-based decoding of low-density parity check code," IEEE J. Sel. Areas Commun., vol.19, no.5, pp.908-917, May 2001.
9. J. Chen and M. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Commun., vol.50, no.3, pp.406-414, March 2002.
10. A. Ohhashi and T. Ohtsuki, "Performance of low-density parity-check (LDPC) code with UMP BP-based algorithm and quantizer on Rayleigh fading channels," VTC 2003-spring, vol.3, pp.1881-1885, April 2003.
11. Y. Inaba and T. Ohtsuki, "Performance of low density parity check (LDPC) codes with bootstrap decoding algorithm on a fast fading channel," VTC 2004-spring, 2004.
12. T. Etzion, A. Trachtenbeg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inf. Theory, vol.45, no.6, pp.2173-2181, Sept. 1999.
13. Y. Mao and A.H. Banihashemi, "Decoding low-density parity-check codes with probabilistic scheduling," IEEE Commun. Lett., vol.5, no.10, pp.414-416, Oct. 2001.