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

WSEAS TRANSACTIONS on COMMUNICATIONS archive

Fast convergence algorithm for decoding of low density parity check codes

XieJin, YinLiuguo, GeNing, LuJianhua

Published Jul 1, 2009• 0 citations
Publisher

Abstract

In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in c...
DOI
10.5555/1639511.1639517

Related papers

Fast convergence algorithm for decoding of low density parity check codes

Jin Xie, Liuguo Yin, Ning Ge +1 more

Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1

WSEAS TRANSACTIONS on COMMUNICATIONS archive•Jul 1, 2009•1 citation

Fast convergence algorithm for LDPC Codes

Frank Kienle, Timo Lehnigk-Emden, Norbert Wehn

Low-density parity-check (LDPC) codes are one of the most powerful codes known today. They are decoded iteratively by a message passing algorithm. There exist many different update schemes of the exchanged messages. The major difference of all update schemes is the convergence speed, i.e. the achieved communications performance for a limited number of iterations. This paper presents a new decoding algorithm which efficiently utilizes the encoder property of linear encodable LDPC codes. The basic idea is to interpret the LDPC encoder as an encoder with puncturing unit which opens as well the door for hybrid ARQ schemes. The presented new decoding algorithm shows a faster convergence behavior than state of art decoding schemes and it results in a lower error floor

IEEE Vehicular Technology Conference•Sep 8, 2006•10 citations

Novel Efficient Decoding Implementation of LDPC Codes

Wenbo Wang

As for the sum-product decoding algorithm of low density parity check(LDPC) codes,a difference-based decoding method is proposed.The main idea is shown as follows: the messages passed on the bipartite graph of LDPC are based on the probability differences,and the updates of both check nodes and message nodes are carried out on some special addition domain.As for the update of check nodes,only some lowest differences can be selected for reducing computational complexity.In contrast with the traditional log-likelyhood-ratio-based(LLR-based) decoding method,the proposed method has much lower complexity,while it has no obvious loss of performance and convergence.

Beijing Youdian Xueyuan xuebao•Jan 1, 2007•1 citation

Fast Decoding Algorithm for Low-Density Parity-Check Codes

Wang Dan, Li Ping, Hu Yu +1 more

A fast decoding algorithm for low-density parity-check codes is presented based on graph decomposition and two-way message passing schedule. Simulations show that the convergence speed of the proposed algorithm is about twice as fast as that of the conventional belief propagation algorithm.

IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications•Apr 28, 2006•0 citations

Fast Decoding Algorithm for Low-Density Parity-Check Codes

Dan Wang

A fast decoding algorithm for low-density parity-check codes is presented based on graph decomposition and two-way message passing schedule. Simulations show that the convergence speed of the proposed algorithm is about twice that of the conventional belief propagation algorithm.

IEICE Transactions on Communications•Nov 1, 2005•1 citation

A Modified Serial Decoding Algorithm for Low-Density Parity-Check Codes

Baoyu Tian

A modified serial decoding algorithm for low-density parity-check(LDPC) codes is proposed.Unlike conventional approaches,this algorithm calculates the sum of variable-to-check messages only once at the initialization stage,and then updates it by simple recursions during the decoding stage.Compared with the conventional serial LDPC decoding algorithm,the proposed algorithm has lower computational complexity and higher processing speed without any performance deterioration.

•Jan 1, 2008•1 citation
Abstract: In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce about 1/6 iteration numbers for LDPC codes used in DVB-S2, with hardware complexity overhead less than 2%. Key–Words: LDPC code, fast convergence decoding algorithm, layered decoding, min-sum algorithm, hardware implementation 1
Low-density parity-check (LDPC) codes are one of the most powerful codes known today. They are decoded iteratively by a message passing algorithm. There exist many different update schemes of the exchanged messages. The major difference of all update schemes is the convergence speed, i.e. the achieved communications performance for a limited number of iterations. This paper presents a new decoding algorithm which efficiently utilizes the encoder property of linear encodable LDPC codes. The basic idea is to interpret the LDPC encoder as an encoder with puncturing unit which opens as well the door for hybrid ARQ schemes. The presented new decoding algorithm shows a faster convergence behavior than state of art decoding schemes and it results in a lower error floor
As for the sum-product decoding algorithm of low density parity check(LDPC) codes,a difference-based decoding method is proposed.The main idea is shown as follows: the messages passed on the bipartite graph of LDPC are based on the probability differences,and the updates of both check nodes and message nodes are carried out on some special addition domain.As for the update of check nodes,only some lowest differences can be selected for reducing computational complexity.In contrast with the traditional log-likelyhood-ratio-based(LLR-based) decoding method,the proposed method has much lower complexity,while it has no obvious loss of performance and convergence.