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 Wireless Communication Systems

Knowledge-aided reweighted belief propagation decoding for regular and irregular LDPC codes with short blocks

Jingjing Liu, Rodrigo C. de Lamare

Published Aug 1, 2012• 7 citations
Publisher

Abstract

In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications, where both good decoding performance and low-latency are expected. Our simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm and requires a significantly smaller number of iterations than existing algorithms when decoding both regular and irregular LDPC codes.

DOI
10.1109/iswcs.2012.6328515

Related papers

Knowledge-Aided Reweighted Belief Propagation LDPC Decoding using Regular and Irregular Designs

Jingjing Li, Rodrigo C. de Lamare

In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications, where both good decoding performance and low-latency are expected. Our simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm and requires a significantly smaller number of iterations than existing algorithms when decoding both regular and irregular LDPC codes.

arXiv:1403.0847•Mar 4, 2014•0 citations

Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes

Jingjing Liu, Rodrigo C. de Lamare

In this paper we propose a novel message passing algorithm which exploits the existence of short cycles to obtain performance gains by reweighting the factor graph. The proposed decoding algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications with low-latency and short blocks. Simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm, and requires a significantly smaller number of iterations when decoding either general or commercial LDPC codes.

IEEE Communications Letters•Aug 6, 2012•86 citations

Locally-Optimized Reweighted Belief Propagation for Decoding LDPC Codes with Finite-Length

Jingjing Li, Rodrigo C. de Lamare, Henk Wymeersch

In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques.

arXiv:1403.0836•Mar 4, 2014•0 citations

Locally-optimized reweighted belief propagation for decoding finite-length LDPC codes

Jingjing Liu, Rodrigo C. de Lamare, Henk Wymeersch

In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques.

IEEE Wireless Communications and Networking Conference•Apr 1, 2013•2 citations

A weighted group shuffled decoding for low-density parity-check codes

Fatima Zahrae Zenkouar, Mustapha El Alaoui, Saïd Najah

In this paper, we have developed several concepts such as the tree concept, the short cycle concept and the group shuffling concept of a propagation cycle to decrypt low-density parity-check (LDPC) codes. Thus, we proposed an algorithm based on group shuffling propagation where the probability of occurrence takes exponential form exponential factor appearance probability belief propagation-group shuffled belief propagation (EFAP-GSBP). This algorithm is used for wireless communication applications by providing improved decryption performance with low latency. To demonstrate the effectiveness of our suggested technique EFAP-GSBP, we ran numerous simulations that demonstrated that our algorithm is superior to the traditional BP/GSBP algorithm for decrypting LPDC codes in both regular and non-regular forms

Indonesian Journal of Electrical Engineering and Computer Science•Jan 1, 2022•0 citations

A Study on Low Complexity Decoding Algorithm of LDPC Codes

Yong Deng

In this paper,the decoding algorithm of low-density parity-check(LDPC)codes is analyzed,and a new decoding algorithm based on the belief propagation(BP)algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm,the cycles of factor graph will send message back to its source,and this will decrease the decoding performance. The new algorithm records each cycle’s path and length of each node,and cuts off the path by which message is propagated when the message will come back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.

•Jan 1, 2006•0 citations
In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications, where both good decoding performance and low-latency are expected. Our simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm and requires a significantly smaller number of iterations than existing algorithms when decoding both regular and irregular LDPC codes.
In this paper a new message passing algorithm, which takes advantage of both tree-based re-parameterization and the knowledge of short cycles, is introduced for the purpose of decoding LDPC codes with short block lengths. The proposed algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications, where both good decoding performance and low-latency are expected. Our simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm and requires a significantly smaller number of iterations than existing algorithms when decoding both regular and irregular LDPC codes.
In this paper we propose a novel message passing algorithm which exploits the existence of short cycles to obtain performance gains by reweighting the factor graph. The proposed decoding algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications with low-latency and short blocks. Simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm, and requires a significantly smaller number of iterations when decoding either general or commercial LDPC codes.
In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques.
In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques.
In this paper, we have developed several concepts such as the tree concept, the short cycle concept and the group shuffling concept of a propagation cycle to decrypt low-density parity-check (LDPC) codes. Thus, we proposed an algorithm based on group shuffling propagation where the probability of occurrence takes exponential form exponential factor appearance probability belief propagation-group shuffled belief propagation (EFAP-GSBP). This algorithm is used for wireless communication applications by providing improved decryption performance with low latency. To demonstrate the effectiveness of our suggested technique EFAP-GSBP, we ran numerous simulations that demonstrated that our algorithm is superior to the traditional BP/GSBP algorithm for decrypting LPDC codes in both regular and non-regular forms
In this paper,the decoding algorithm of low-density parity-check(LDPC)codes is analyzed,and a new decoding algorithm based on the belief propagation(BP)algorithm to eliminate the influence of cycles in the factor graph is proposed. In the traditional BP algorithm,the cycles of factor graph will send message back to its source,and this will decrease the decoding performance. The new algorithm records each cycle’s path and length of each node,and cuts off the path by which message is propagated when the message will come back. It can advance the decoding performance by protect the message of good quality be propagated as widely as possible. Our results of simulation show that the performance of new algorithm is not worse than that of traditional BP algorithm in the low SNR channel and the new algorithm significantly outperform traditional BP algorithm in good channel condition.