By Topic

Decoding of generalised low-density parity-check codes using weighted bit-flip voting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hirst, S. ; Dept. of Commun. Syst., Lancaster Univ., UK ; Honary, B.

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

Published in:

Communications, IEE Proceedings-  (Volume:149 ,  Issue: 1 )