Title :
Reduced-complexity decoding algorithm for low-density parity-check codes
Author :
Eleftheriou, E. ; Mittelholzer, T. ; Dholakia, A.
Author_Institution :
Zurich Res. Lab., IBM Res., Ruschlikon, Switzerland
fDate :
1/18/2001 12:00:00 AM
Abstract :
A new reduced-complexity decoding algorithm for low-density parity-check codes that operates entirely in the log-likelihood domain is presented. The computationally expensive check-node updates of the sum-product algorithm are simplified by using a difference-metric approach on a two-state trellis and by employing the dual-max approximation. The dual-max approximation is further improved by using a correction factor that allows the performance to approach that of full sum-product decoding
Keywords :
computational complexity; error detection codes; iterative decoding; probability; correction factor; difference-metric approach; dual-max approximation; log-likelihood domain; low-density parity-check codes; reduced-complexity decoding algorithm; sum-product algorithm; two-state trellis;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20010077
