Title :
Application of efficient Chase algorithm in decoding of generalized low-density parity-check codes
Author :
Hirst, Simon ; Honary, Bahram
Author_Institution :
Dept. of Commun. Syst., Lancaster Univ., UK
Abstract :
We consider the iterative decoding of generalized low-density (GLD) parity-check codes where, rather than employ an optimal subcode decoder, a Chase (1972) algorithm decoder more commonly associated with "turbo product codes" is used. GLD codes are low-density graph codes in which the constraint nodes are other than single parity-checks. For extended Hamming-based GLD codes, we use bit error rates derived by simulation to demonstrate this new strategy to be successful at higher code rates. For long block lengths, good performance close to capacity is possible with decoding costs reduced further since the Chase decoder employed is an efficient implementation.
Keywords :
Hamming codes; computational complexity; error correction codes; error detection codes; error statistics; iterative decoding; BER; Chase decoder; SISO decoder; binary-input AWGN channel; bit error rates; capacity; code rate; constraint nodes; decoding costs reduction; efficient Chase algorithm; extended Hamming-based GLD codes; generalized low-density parity-check codes; iterative decoding; long block length; low-density graph codes; simulation; turbo product codes; Bipartite graph; Bit error rate; Costs; Graph theory; Iterative algorithms; Iterative decoding; Parity check codes; Product codes; Sparse matrices;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2002.803487