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

IEEE Vehicular Technology Conference

Reduced Complexity and Improved Performance for Short Regular LDPC Codes Based on Select Updating Schedule

Jianquan Liu, Youyun Xu, Yueming Cai

Published Apr 1, 2007• 0 citations
Publisher

Abstract

In this paper, we present a modified BP decoding algorithm based on select updating schedule by analyzing the properties of message-passing through cycles, we also proposed a concrete scheme to obtain the select updating schedule, the simulations prove that we could improve performance and reduce complexity at the same time for short regular LDPC codes which have a small difference between the maximal and minimal single bit node girths by select updating schedule compared with the conventional BP decoding algorithm.

DOI
10.1109/vetecs.2007.320

Related papers

Serial Update Scheduling Based on Weighted Average Message of Check Nodes for LDPC Codes

Xingcheng Liu

For short and middle length LDPC codes,the oscillation of LLR owing to cycles degrades the performance of BP algorithm.In order to minimize the oscillation of LLR during BP decoding process,an improved BP algorithm with serial update scheduling using weighted average message to update the message of check-to-variable node is proposed.Currently computed message of check-to-variable node and the message of old check-to-variable node are weighted and then added up to update the message of check-to-variable node.By higher weighted currently computed message of check-to-variable node than the message of old check-to-variable node,the improved algorithm effectively minimizes oscillation of LLR,at the same time,keeps normal BP message propagation and low compute complexity.Simulation results show that,for short and middle length LDPC codes,the improved algorithm achieves more noticeable error performance than CSBP algorithm at middle to high signal to noise ratio.

Acta Scientiarum Naturalium Universitatis Sunyatseni•Jan 1, 2010•0 citations

An Improved Message Passing Schedule of BP-Based Decoding Algorithm for LDPC Codes

Dong Jingru, Hang Yin, Sijia Wang

In this paper, we propose an optimized schedule called IRMP (Improved Row Message Passing) schedule, based on analysis of the existing message passing schedules. This type of schedule has changed the message updating order between variable and check nodes. In accordance with this schedule, an improved BP-Based decoding algorithm is proposed. Simulations show that, this algorithm has beaten the performance of BP-Based algorithms available in terms of error rate and number of iteration.

IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)•Dec 1, 2016•3 citations

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

Partially-parallel irregular LDPC decoder based on improved message passing schedule

Xing Li, Kazunori Shimizu, Zhen Qiu +2 more

In this paper, we propose a new efficient message-passing schedule for irregular LPDC code. Our approach is based on the schedule designed for regular LDPC code. We have modified the original schedule for regular LDPC code and improved it particularly for the irregular LDPC coder realization. The experimental results show that our method could achieve better performance than conventional one, and improve the converging rate as well.

IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)•Aug 1, 2007•0 citations

Reduced complexity and improved performance decoding algorithm for nonbinary LDPC codes over GF(q)

Xin Chen, Aidong Men

Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.

IEEE International Conference on Communication Technology (ICCT)•Nov 1, 2008•6 citations

Reduced-Complexity Decoding of LDPC Codes

Reduced-Complexity Decoding of LDPC Codes Various log-likelihood-ratio-based belief-propagation (LLR- BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representation of the decoding computations are shown to achieve a reduction in complexity, by simplifying the check-node update or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from a performance, latency, computational complexity, and memory-requirement perspective.

IEEE Transactions on Communications•Jul 1, 2005•27 citations
In this paper, we present a modified BP decoding algorithm based on select updating schedule by analyzing the properties of message-passing through cycles, we also proposed a concrete scheme to obtain the select updating schedule, the simulations prove that we could improve performance and reduce complexity at the same time for short regular LDPC codes which have a small difference between the maximal and minimal single bit node girths by select updating schedule compared with the conventional BP decoding algorithm.
For short and middle length LDPC codes,the oscillation of LLR owing to cycles degrades the performance of BP algorithm.In order to minimize the oscillation of LLR during BP decoding process,an improved BP algorithm with serial update scheduling using weighted average message to update the message of check-to-variable node is proposed.Currently computed message of check-to-variable node and the message of old check-to-variable node are weighted and then added up to update the message of check-to-variable node.By higher weighted currently computed message of check-to-variable node than the message of old check-to-variable node,the improved algorithm effectively minimizes oscillation of LLR,at the same time,keeps normal BP message propagation and low compute complexity.Simulation results show that,for short and middle length LDPC codes,the improved algorithm achieves more noticeable error performance than CSBP algorithm at middle to high signal to noise ratio.
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.
Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.
Reduced-Complexity Decoding of LDPC Codes Various log-likelihood-ratio-based belief-propagation (LLR- BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representation of the decoding computations are shown to achieve a reduction in complexity, by simplifying the check-node update or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from a performance, latency, computational complexity, and memory-requirement perspective.