DocumentCode :
747607
Title :
Decoding of generalised low-density parity-check codes using weighted bit-flip voting
Author :
Hirst, S. ; Honary, B.
Author_Institution :
Dept. of Commun. Syst., Lancaster Univ., UK
Volume :
149
Issue :
1
fYear :
2002
fDate :
2/1/2002 12:00:00 AM
Firstpage :
1
Lastpage :
5
Abstract :
A generalised low-density parity-check code (GLDPC) is a low-density parity-check code in which the constraint nodes of the code´s graph are replaced with component or subcodes other than single parity checks. Gallager´s (1963) bit-flipping algorithm for LDPCs is generalised to the class of GLDPCs with Hamming subcodes. The proposed weighted bit-flip voting (WBFV) method is iterative and uses only the hard decision decoder of the Hamming subcodes. Decoding of Hamming-based GLDPCs using WBFV has been simulated on the binary symmetric channel. Simulation results are presented showing the variation in performance with voting rule, graph construction and block length. In terms of the dependence of coding gains and complexity on the GLDPC block length, the proposed method is found to display a good performance to decoding complexity trade-off. The performance is found to compete well with other more conventional hard decision decoding schemes
Keywords :
Hamming codes; computational complexity; error correction codes; error detection codes; graph theory; iterative decoding; Hamming subcodes; binary symmetric channel; bit-flipping algorithm; code graph; constraint nodes; decoding complexity; error-correcting block subcodes; generalised low-density parity-check codes; graph GLDPC block length; hard decision decoder; hard decision decoding; iterative decoding; simulation results; subcodes; turbo decoding; voting rule; weighted bit-flip voting;
fLanguage :
English
Journal_Title :
Communications, IEE Proceedings-
Publisher :
iet
ISSN :
1350-2425
Type :
jour
DOI :
10.1049/ipcom:20020307
Filename :
1002733
Link To Document :
بازگشت