By Topic

Fast convergence decoding scheme for regular LDPC codes

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 $13
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

3 Author(s)
Jaebum Kim ; Sch. of Eng., Inf. & Commun. Univ., Daejeon, South Korea ; Namsik Kim ; Hyuncheol Park

We propose a new belief propagation (BP) decoding algorithm for fast convergence decoding of regular LDPC codes. The fast convergence is achieved by grouping and scheduling updates of nodes on a bipartite-graph without additional computations or approximations. For this reason, the proposed algorithm can be applied to a serially constructed decoder, and can reduce the power consumption and decoding delay of the decoder. Simulation results show that the convergence speed of the proposed algorithm depends on the degree, dv, of the variable-nodes of the bipartite-graph, and the average number of iterations of the decoder can be reduced to (dv-1)/dv by using the proposed algorithm without performance degradation or additional computation.

Published in:

Intelligent Signal Processing and Communication Systems, 2004. ISPACS 2004. Proceedings of 2004 International Symposium on

Date of Conference:

18-19 Nov. 2004