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

The Journal of the Korea institute of electronic communication sciences

Node Monitoring Algorithm with Piecewise Linear Function Approximation for Efficient LDPC Decoding

Heejong Suh

Published Jan 1, 2011• 0 citations
Publisher

Abstract

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

DOI
10.13067/jkiecs.2011.6.1.020

Related papers

Node Monitoring Algorithm with Piecewise Linear Function Approximation for Efficient LDPC Decoding

오빈빈, 진호, 서희종

We propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is improved to about 20%, compared with well-known methods.

대한전자공학회 학술대회•Nov 1, 2010•0 citations

Efficient LDPC Decoding Algorithm Using Node Monitoring

Heejong Suh

본 논문에서는 노드 모니터링(NM)과 Piecewise Linear Function Approximation(: NP)을 사용하여 LDPC 디코딩 알고리듬의 계산복잡도를 감소시키는 알고리듬을 제안한다. 이 알고리듬은 기존의 알고리듬보다도 더 효율적이다. 제안된 알고리즘이 기존의 방법보다도 개선되었다는 것을 확인하기 위해서 모의실험을 하였다. 실험결과, 제안된 알고리즘의 계산은 기존의 방법에 비해 약 20 % 향상되었음을 확인하였다. In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.

The Journal of the Korea institute of electronic communication sciences•Nov 30, 2015•0 citations

A Node Monitoring Algorithm for Efficient LDPC Decoding

주경삼, 양석, 서희종

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is improved to about 10%, compared with well-known methods.

대한전자공학회 학술대회•Jun 1, 2008•2 citations

Simplified sum-product algorithm using piecewise linear function approximation for low complexity LDPC decoding

Jae Hee Han, Myung Hoon Sunwoo

This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.

International Conference on Ubiquitous Information Management and Communication (IMCOM)•Feb 15, 2009•7 citations

Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes

Xiaopeng Jiao, Jianjun Mu, Haoyuan Wei

Similar to the belief propagation decoder, linear programming decoding based on the alternating direction method of multipliers (ADMM) can also be seen as an iterative message-passing decoding algorithm. How to schedule messages efficiently is an important aspect since it will influence the convergence rate of iterative decoders. In this letter, we investigate the node-wise scheduling for ADMM decoders, named NS-ADMM. In particular, we propose a reduced-complexity method for the NS-ADMM decoder by avoiding Euclidean projections involved in the calculation of message residuals. Simulation results show that the proposed method converges much faster than the flooding and layered scheduling while keeping a lower complexity when compared with the NS-ADMM decoder.

IEEE Communications Letters•Dec 22, 2016•25 citations

Piecewise Linear Interpolation based LOG-BP algorithm for 5G LDPC codes

Bin Xu, Yin Xu, Dazhi He +3 more

BP algorithm is one of the most prominent decoding algorithms based on message passing. However, it is not commonly adopted in hardware implementation for the high computational complexity. The normalized min-sum (NMS) algorithm was then proposed to solve this problem but with performance flaws. To satisfy the comprehensive requirements of complexity and accuracy in 5G systems, we introduce an approximated algorithm based on BP in log-domain and name it piecewise linear interpolation based LOG-BP (PLI-LOG-BP) algorithm. In our novel algorithm, the non-linear mapping function in the horizontal step of BP is replaced by several linear functions for simplification. Meanwhile, we also propose an MMSE-based selection algorithm of segment points that improves the approximation accuracy. To verify the validation of the proposed algorithm, we apply 5G LDPC codes in our simulation and obtain BLER performance results. According to these results, PLI-LOG-BP algorithm decoding performance is significantly better than the NMS algorithm and even almost as good as the BP algorithm.

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)•Aug 4, 2021•1 citation
In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.
본 논문에서는 노드 모니터링(NM)과 Piecewise Linear Function Approximation(: NP)을 사용하여 LDPC 디코딩 알고리듬의 계산복잡도를 감소시키는 알고리듬을 제안한다. 이 알고리듬은 기존의 알고리듬보다도 더 효율적이다. 제안된 알고리즘이 기존의 방법보다도 개선되었다는 것을 확인하기 위해서 모의실험을 하였다. 실험결과, 제안된 알고리즘의 계산은 기존의 방법에 비해 약 20 % 향상되었음을 확인하였다. In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.
This paper proposes the simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes (LDPC). The sum-product algorithm achieves the highest BER performance among the LDPC decoding algorithms. However, based on the hyperbolic tangent and inverse hyperbolic tangent functions for the check node updates, the sum-product (SP) algorithm requires high computational complexity. To reduce computational complexity, the proposed SSP algorithm adopts a piecewise linear approximation, the logarithmic and exponential functions, which can replace multiplications and divisions with additions and subtractions. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Simulation results show that the proposed SSP algorithm can improve about 0.8 dB of bit error ratio (BER) performance compared with the modified sum-product algorithm.
Similar to the belief propagation decoder, linear programming decoding based on the alternating direction method of multipliers (ADMM) can also be seen as an iterative message-passing decoding algorithm. How to schedule messages efficiently is an important aspect since it will influence the convergence rate of iterative decoders. In this letter, we investigate the node-wise scheduling for ADMM decoders, named NS-ADMM. In particular, we propose a reduced-complexity method for the NS-ADMM decoder by avoiding Euclidean projections involved in the calculation of message residuals. Simulation results show that the proposed method converges much faster than the flooding and layered scheduling while keeping a lower complexity when compared with the NS-ADMM decoder.
BP algorithm is one of the most prominent decoding algorithms based on message passing. However, it is not commonly adopted in hardware implementation for the high computational complexity. The normalized min-sum (NMS) algorithm was then proposed to solve this problem but with performance flaws. To satisfy the comprehensive requirements of complexity and accuracy in 5G systems, we introduce an approximated algorithm based on BP in log-domain and name it piecewise linear interpolation based LOG-BP (PLI-LOG-BP) algorithm. In our novel algorithm, the non-linear mapping function in the horizontal step of BP is replaced by several linear functions for simplification. Meanwhile, we also propose an MMSE-based selection algorithm of segment points that improves the approximation accuracy. To verify the validation of the proposed algorithm, we apply 5G LDPC codes in our simulation and obtain BLER performance results. According to these results, PLI-LOG-BP algorithm decoding performance is significantly better than the NMS algorithm and even almost as good as the BP algorithm.