Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)

Fast convergence decoding scheme tor regular LDPC codes

Jaebum Kim, Nam-Sik Kim, Hyuncheol Park

Published Jun 15, 2005• 1 citation
Publisher

Abstract

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, d/sub v/, of the variable-nodes of the bipartite-graph, and the average number of iterations of the decoder can be reduced to (d/sub v/-1)/d/sub v/ by using the proposed algorithm without performance degradation or additional computation.

DOI
10.1109/ispacs.2004.1439096

Related papers

An efficient scheduling scheme for layered belief propagation decoding of regular LDPC codes

Hua Li, Hong Wei Ding, Linhua Zheng +3 more

Schedule plays an important role in layered belief propagation (BP) decoding of low-density parity-check (LDPC) codes. It affects the error-rate performance as well as convergence rate of the decoder. In this paper, an efficient scheduling scheme is proposed to arrange the updating order of check nodes for layered BP decoder of regular LDPC codes. This scheme selects check node one at a time based on the reliability of the variable nodes. Specifically each time the check node with maximum number of low-reliability neighbors is selected. For simplicity, we introduce the updating state instead of the real-time messages to represent variable-node reliability. Simulation results on regular LDPC codes prove that the proposed scheduling scheme can obtain efficient schedules with fast convergence and good error-rate performance.

International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)•Oct 1, 2016•6 citations

Improved belief propagation algorithm for decoding of convolutional LDPC codes

Chen Ru-wei

A novel belief propagation(BP) decoding algorithm for convolutional low-density parity-check codes is proposed.The proposed algorithm raises the efficiency of updating the variable information by applying feedback information at each decoding iteration and employs the weighting factor to reduce the error propagation caused by the cycles in the Tanner graph,thus yielding a faster convergence of the decoding.Simulation results show that an error performance better than that of the existing belief propagation algorithm can be achieved,while the 5/8 decoding delay and the computation complexity are effectively reduced.Compared with the existing BP,the proposed algorithm achieves a gain of 0.16dB at the BER of 10-6 with the same number of iterations.

Journal of Xidian University•Jan 1, 2009•0 citations

New group shuffled BP decoding algorithms for LDPC codes

Chi-Yuan Chang, Yu‐Liang Chen, Chang‐Ming Lee +1 more

Implementing a belief propagation (BP) based LDPC decoder requires high degrees of parallelism using many component soft-in soft-output (SISO) decoding units to perform message passing from variable nodes to check nodes or vice versa. An obvious complexity-reduction solution is to serialize the decoding process, i.e., dividing a decoding iteration into several serial sub-iterations in which a sub-iteration performs only part of the complete parallel message-passing operation. The group horizontal shuffled BP (GHSBP) and vertical shuffled BP (GVSBP) algorithms respectively partition the check and variable nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes new techniques to improve three key elements of a GHSBP decoding algorithm, namely, the grouping method, the decoding schedule and the log-likelihood updating formulae. The (check nodes) grouping method and decoding schedule optimize certain design criterion. The new normalized min-sum updating formula with a self-adjustable correction (scaling) factor offers better nonlinear approximation. Numerical performance of new GHSBP algorithms that include part or all three new techniques indicate that the combination of the proposed grouping and decoding schedule yields a faster convergence rate and our modified min-sum algorithm gives performance superior to that of the conventional min-sum and normalized min-sum algorithm and is very close to that of the sum-product algorithm.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•4 citations

A hybrid belief propagation decoding algorithms of LDPC codes for fast convergence

Tso-Cho Chen, Chia‐Jung Li, Erl‐Huei Lu

A hybrid belief propagation (BP) decoding algorithm for low-density parity-check code is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. The hybrid scheme is presented by integrating the BP algorithm with the bit-flipping function which is used as adaptive weighted factor in the BP iteration decoding. The adaptive weighting factor is based on the average weighted reliability measure of the hard output of decoder. The proposed hybrid adaptive weighted iteration scheme can efficiently increase the convergence speed of the belief propagation decoding and therefore improve the error performance. Simulation results show that the proposed algorithm can significantly reduce the decoding complexity and achieve better error performances as compared with the sum-product algorithm.

Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC)•Jul 1, 2013•5 citations

A fast convergence decoding algorithm for LDPC codes

Xinmei Wang

A realization of belief propagation algorithms based on the two-way schedule and a serial concatenated decoding algorithm for LDPC codes based on the matrix decomposition are presented. The performance of this new algorithm is systematically analyzed via the density evolution theory. Analysis and simulation results show that the serial concatenated decoding algorithm demonstrates a higher convergence speed and has as good performance as the conventional belief propagation algorithm.

Journal of Xidian University•Jan 1, 2005•0 citations

A Non-Disjoint Group Shuffled Decoding for LDPC Codes

Yen-Cheng Hsu, Tofar C.-Y. Chang, Yu T. Su +1 more

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes a new grouping technique to accelerate the message-passing rate. Performance of the proposed algorithm is analyzed by a Gaussian approximation approach. Both analysis and numerical experiments verify that the new algorithm does yield a convergence rate faster than that of existing conventional or group shuffled BP decoder with the same computing complexity constraint.

arXiv:1202.1060•Feb 6, 2012•0 citations
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, d/sub v/, of the variable-nodes of the bipartite-graph, and the average number of iterations of the decoder can be reduced to (d/sub v/-1)/d/sub v/ by using the proposed algorithm without performance degradation or additional computation.
Schedule plays an important role in layered belief propagation (BP) decoding of low-density parity-check (LDPC) codes. It affects the error-rate performance as well as convergence rate of the decoder. In this paper, an efficient scheduling scheme is proposed to arrange the updating order of check nodes for layered BP decoder of regular LDPC codes. This scheme selects check node one at a time based on the reliability of the variable nodes. Specifically each time the check node with maximum number of low-reliability neighbors is selected. For simplicity, we introduce the updating state instead of the real-time messages to represent variable-node reliability. Simulation results on regular LDPC codes prove that the proposed scheduling scheme can obtain efficient schedules with fast convergence and good error-rate performance.
A novel belief propagation(BP) decoding algorithm for convolutional low-density parity-check codes is proposed.The proposed algorithm raises the efficiency of updating the variable information by applying feedback information at each decoding iteration and employs the weighting factor to reduce the error propagation caused by the cycles in the Tanner graph,thus yielding a faster convergence of the decoding.Simulation results show that an error performance better than that of the existing belief propagation algorithm can be achieved,while the 5/8 decoding delay and the computation complexity are effectively reduced.Compared with the existing BP,the proposed algorithm achieves a gain of 0.16dB at the BER of 10-6 with the same number of iterations.
Implementing a belief propagation (BP) based LDPC decoder requires high degrees of parallelism using many component soft-in soft-output (SISO) decoding units to perform message passing from variable nodes to check nodes or vice versa. An obvious complexity-reduction solution is to serialize the decoding process, i.e., dividing a decoding iteration into several serial sub-iterations in which a sub-iteration performs only part of the complete parallel message-passing operation. The group horizontal shuffled BP (GHSBP) and vertical shuffled BP (GVSBP) algorithms respectively partition the check and variable nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes new techniques to improve three key elements of a GHSBP decoding algorithm, namely, the grouping method, the decoding schedule and the log-likelihood updating formulae. The (check nodes) grouping method and decoding schedule optimize certain design criterion. The new normalized min-sum updating formula with a self-adjustable correction (scaling) factor offers better nonlinear approximation. Numerical performance of new GHSBP algorithms that include part or all three new techniques indicate that the combination of the proposed grouping and decoding schedule yields a faster convergence rate and our modified min-sum algorithm gives performance superior to that of the conventional min-sum and normalized min-sum algorithm and is very close to that of the sum-product algorithm.
A hybrid belief propagation (BP) decoding algorithm for low-density parity-check code is proposed to accelerate the convergence of decoding and reduce the number of decoding iterations. The hybrid scheme is presented by integrating the BP algorithm with the bit-flipping function which is used as adaptive weighted factor in the BP iteration decoding. The adaptive weighting factor is based on the average weighted reliability measure of the hard output of decoder. The proposed hybrid adaptive weighted iteration scheme can efficiently increase the convergence speed of the belief propagation decoding and therefore improve the error performance. Simulation results show that the proposed algorithm can significantly reduce the decoding complexity and achieve better error performances as compared with the sum-product algorithm.
To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes a new grouping technique to accelerate the message-passing rate. Performance of the proposed algorithm is analyzed by a Gaussian approximation approach. Both analysis and numerical experiments verify that the new algorithm does yield a convergence rate faster than that of existing conventional or group shuffled BP decoder with the same computing complexity constraint.