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

A New Genetics-Aided Message Passing Decoding Algorithm for LDPC Codes

Jui-Hui Hung, Yi-De Lu, Sau-Gee Chen

Published Sep 1, 2012• 0 citations
Publisher

Abstract

The popular LDPC decoding algorithms based on the message passing (MP) algorithm have high decoding performances. However, they are noticeably inferior to the maximum likelihood (ML) decoding algorithm. This work proposes a genetics-aided message passing (GA-MP) algorithm by applying a new genetic algorithm to MP algorithm. As a result, significantly performance improvement over MP algorithm can be achieved. Besides, compared with other genetic-aided decoding algorithms, the proposed algorithm has much better performances and much lower computational complexity. Simulations show that the decoding performance of GA-MP algorithm can achieve performances very close to the algorithm, while outperform MP algorithm. Besides, its performance will grow proportionally with the generation number without leveling off as observed in conventional MP algorithms, under high SNR condition.

DOI
10.1109/vtcfall.2012.6399254

Related papers

MP&A Mixed Decoding Algorithm for LDPC Codes

Chia‐Lu Ho, Hsu-Hung Yang

Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10-5, the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.

Conference on Communication Networks and Services Research•May 1, 2007•0 citations

Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders

Shiva Kumar Planjery, David Declercq, Ludovic Danjean +1 more

Introduced is a new type of message-passing (MP) decoders for low-density parity-check (LDPC) codes over the binary symmetric channel. Unlike traditional belief propagation (BP) based MP algorithms which propagate probabilities or log-likelihoods, the new MP decoders propagate messages requiring only a finite number of bits for their representation in such a way that good performance in the error floor region is ensured. Additionally, these messages are not quantised probabilities or log-likelihoods. As examples, MP decoders are provided that require only three bits for message representation, but surpass the floating-point BP (which requires a large number of bits for representation) in the error-floor region.

Electronics Letters•Aug 4, 2011•26 citations

Decoding Algorithm of LDPC Codes Based on Genetic Algorithm

Sheng Huang, Kai Tian, Fangfang Tian +1 more

In order to improve the decoding performance of low density parity check (LDPC) codes, a sum-product genetic decoding (SPGD) algorithm based on genetic algorithm (GA) is proposed. By means of the classical decoding algorithm of sum-product algorithm (SPA) of LDPC codes, variable node information generated by each hard decision of iteration is regarded as individuals that constitute initial population of GA. The decoded optimal solutions are produced by a series of genetic operations. Simulation results show that under the premise of almost no increase in complexity, the proposed SPGD algorithm has the superior decoding error correction performance, better practicability and higher net coding gain (NCG).

IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)•Jan 1, 2013•5 citations

New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes

Sunghwan Kim, Min‐Ho Jang, Jong‐Seon No +2 more

In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm, especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.

한국통신학회논문지•Apr 1, 2005•0 citations

Improve Sum-Product Algorithm and Genetics-Aided for LDPC Codes

Mohammad Akbari, G. Zare Fatin, Reza Asvadi

In this letter, we analyze the performance of two improved Sum-Product (SP) based decoding algorithms for LDPC codes. In order to improve the decoding operation and fast convergence decoder At First, Using Averaging and using bits in the wrong equations for improve the bit node update And then by using a genetic algorithm. We corrected value bits decoding mistake is detected and value soft decision is less than 2. The decoding performance of GA-SP algorithm is superior to original SP algorithms by about 2 dB and is very close to the performance of ML decoding for (2640, 1320) Tanner LDPC code.

Digital Signal Processing•Jan 1, 2016•0 citations

Sequential message-passing decoding of LDPC codes by partitioning check nodes

Sunghwan Kim, Min‐Ho Jang, Jong‐Seon No +2 more

In this paper, we analyze the sequential message- passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.

IEEE Transactions on Communications•Jul 1, 2008•7 citations
The popular LDPC decoding algorithms based on the message passing (MP) algorithm have high decoding performances. However, they are noticeably inferior to the maximum likelihood (ML) decoding algorithm. This work proposes a genetics-aided message passing (GA-MP) algorithm by applying a new genetic algorithm to MP algorithm. As a result, significantly performance improvement over MP algorithm can be achieved. Besides, compared with other genetic-aided decoding algorithms, the proposed algorithm has much better performances and much lower computational complexity. Simulations show that the decoding performance of GA-MP algorithm can achieve performances very close to the algorithm, while outperform MP algorithm. Besides, its performance will grow proportionally with the generation number without leveling off as observed in conventional MP algorithms, under high SNR condition.
Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10-5, the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.
Introduced is a new type of message-passing (MP) decoders for low-density parity-check (LDPC) codes over the binary symmetric channel. Unlike traditional belief propagation (BP) based MP algorithms which propagate probabilities or log-likelihoods, the new MP decoders propagate messages requiring only a finite number of bits for their representation in such a way that good performance in the error floor region is ensured. Additionally, these messages are not quantised probabilities or log-likelihoods. As examples, MP decoders are provided that require only three bits for message representation, but surpass the floating-point BP (which requires a large number of bits for representation) in the error-floor region.
In order to improve the decoding performance of low density parity check (LDPC) codes, a sum-product genetic decoding (SPGD) algorithm based on genetic algorithm (GA) is proposed. By means of the classical decoding algorithm of sum-product algorithm (SPA) of LDPC codes, variable node information generated by each hard decision of iteration is regarded as individuals that constitute initial population of GA. The decoded optimal solutions are produced by a series of genetic operations. Simulation results show that under the premise of almost no increase in complexity, the proposed SPGD algorithm has the superior decoding error correction performance, better practicability and higher net coding gain (NCG).
In this paper, we propose a new sequential message-passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This new decoding algorithm shows better bit error rate(BER) performance than that of the conventional message-passing decoding algorithm, especially for small number of iterations. Analytical results tell us that as the number of partitioned subsets of check nodes increases, the BER performance becomes better. We also derive the recursive equations for mean values of messages at variable nodes by using density evolution with Gaussian approximation. Simulation results also confirm the analytical results.
In this letter, we analyze the performance of two improved Sum-Product (SP) based decoding algorithms for LDPC codes. In order to improve the decoding operation and fast convergence decoder At First, Using Averaging and using bits in the wrong equations for improve the bit node update And then by using a genetic algorithm. We corrected value bits decoding mistake is detected and value soft decision is less than 2. The decoding performance of GA-SP algorithm is superior to original SP algorithms by about 2 dB and is very close to the performance of ML decoding for (2640, 1320) Tanner LDPC code.
In this paper, we analyze the sequential message- passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.