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 Correcting Capacity of TPC and An Improved Iterative Decoding Algorithm

Qiang Fu, Jianhui Wang

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

Abstract:Contraposing the distance between the theoretic correcting capacity and the actual correcting capacity of TPC, on the base of studying the encoding and constructing methods of the TPC, this paper analysed the theoretic correcting capacity and the actual correcting capacity of TPC，and indicated that if the two component codes had error-correcting capacity t, the TPC had error-correcting capacity (t+1)2+t. An improved iterative decoding algorithm which could be used after usual decoding algorithms to improve the decoding performance was brought forward，and it can correct some errors which usual decoding algorithms could detect but could not correct. The simulation result showed that the improved iterative decoding algorithm could lower the BER, especially when the SNR was low.

Related papers

The Correcting Capacity of TPC and an Improved Iterative Decoding Algorithm

Jianhui Wang

Considering the difference between the theoretic correcting capacity and the actual correcting capacity of TPC,on the base of studying the encoding and constructing methods of the TPC,the theoretic correcting capacity and the actual correcting capacity of TPC were analyzed,and the result showed that if the two component codes has the error-correcting capacity of t,the TPC has the error-correcting capacity of(t+1)2+t.An improved iterative decoding algorithm which could be used after usual decoding algorithms to improve the decoding performance was put forward,and it can correct some errors which usual decoding algorithms could detect but could not correct.The simulation result showed that the improved iterative decoding algorithm could lower the BER,especially when the SNR was low.

Journal of Sichuan University•Jan 1, 2008•0 citations

An Improved BP Decoding Algorithm of LDPC Codes

Aosong Zhou

With the best error-correcting performance,LDPC codes can be widely used in deep space communication.Based on the study of BP decoding algorithm,LDPC codes were stimulated and the BER performance transforming with the decoding iteration number was analyzed.Then an improved BP decoding algorithm,which significantly reduced the iteration number when SNR was lower than the decoding threshold,but,hardly degraded the decoding performance,was proposed.The performance of the improved BP decoding algorithm was validated by stimulation.This improved BP decoding algorithm is valuable to deep space communication where small-scale equipment is required.

Journal of Astronautics•Jan 1, 2009•0 citations

Analysis of Hamming code's iterative decoding performance based on sum-product algorithm

Dan Wang, Lin Wang, Wei Qin-fang

Iterative decoding that is adopted by near capacity limit error-correcting codes,improves the correcting capability of coding system greatly.This paper presents the design of encoding and decoding system of hamming codes with iterative decoding,and the theoretical analysis of iterative decoding process of hamming codes using modern encoding and decoding theory such as factor graph and sum-product algorithm.Simulation results show that there is 3 db coding gain between iterative decoding and classical decoding in hamming codes when the BER(bit error rate) is 10~(-3) under some times of iterative decoding and AWGN channel.At the same time,the BER performances between iterative decoding and the best enumerate decoding are equal,but the complexity of iterative decoding descends evidently,which is of importantly actual value for the hamming codes to be used in practical systems.

Journal of Chongqing University of Posts and Telecommunications•Jan 1, 2005•0 citations

Iterative decoding algorithm with channel adaptation for LDPC codes

Guojun Han, Xingcheng Liu

For short to moderate block-length LDPC codes, a large number of uncorrected error frames causes the increase of average number of iterations in the region of low SNR(Signal-to-Noise Ratio) and the oscillation of some variable nodes degrades the error performance in the region of medium to high SNR. In order to reduce the average number of iterations in the region of low SNR and improve error performance in the region of medium to high SNR, an iterative decoding algorithm with channel adaptation is proposed. The decoding method with pre-decision making based on error patterns of check-sum and weighted average message is adopted in this algorithm. Through the primary role of early decision method on reducing average iterations at low SNR and weighted average message on reducing error frames at medium to high SNR, iterative decoding with channel adaptation is realized and high efficient decoding is achieved. Simulation results show that, with the proposed algorithm, the average number of iterations is reduced in the region of low SNR without noticeable error performance degradation, and the error performance is improved in the region of medium to high SNR without obvious increase of the number of iterations compared with standard BP algorithm.

Journal of Circuits and Systems•Jan 1, 2010•0 citations

Early Termination of BCH Codes Aided Iterative Decoding Algorithm for LDPC

Yongbo Wang

In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.

•Jan 1, 2011•0 citations

Decoding algorithm for iterated codes correcting compound errors

Masazumi Kurihara

This paper discusses codes, and a decoding method, that can correct compound errors containing a mix of random and burst errors. Specifically, the paper provides a minimum compound distance that represents a compound error correcting capacity for iterated codes, proposes a compound error correcting decoding algorithm for the code, and demonstrates that the decoding algorithm is capable of correcting compound errors up to half the minimum compound distance of the code. The proposed decoding algorithm is a generalized decoding method in which the decoding method for iterated codes indicated by Reddy and Robinson is a particular case. By this generalization, the proposed decoding algorithm can correct compound errors that cannot be corrected by conventional decoding methods. © 2005 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 89(1): 60–72, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20035

Electronics and Communications in Japan (Part III Fundamental Electronic Science)•Jan 1, 2005•0 citations
Abstract:Contraposing the distance between the theoretic correcting capacity and the actual correcting capacity of TPC, on the base of studying the encoding and constructing methods of the TPC, this paper analysed the theoretic correcting capacity and the actual correcting capacity of TPC，and indicated that if the two component codes had error-correcting capacity t, the TPC had error-correcting capacity (t+1)2+t. An improved iterative decoding algorithm which could be used after usual decoding algorithms to improve the decoding performance was brought forward，and it can correct some errors which usual decoding algorithms could detect but could not correct. The simulation result showed that the improved iterative decoding algorithm could lower the BER, especially when the SNR was low.
Considering the difference between the theoretic correcting capacity and the actual correcting capacity of TPC,on the base of studying the encoding and constructing methods of the TPC,the theoretic correcting capacity and the actual correcting capacity of TPC were analyzed,and the result showed that if the two component codes has the error-correcting capacity of t,the TPC has the error-correcting capacity of(t+1)2+t.An improved iterative decoding algorithm which could be used after usual decoding algorithms to improve the decoding performance was put forward,and it can correct some errors which usual decoding algorithms could detect but could not correct.The simulation result showed that the improved iterative decoding algorithm could lower the BER,especially when the SNR was low.
With the best error-correcting performance,LDPC codes can be widely used in deep space communication.Based on the study of BP decoding algorithm,LDPC codes were stimulated and the BER performance transforming with the decoding iteration number was analyzed.Then an improved BP decoding algorithm,which significantly reduced the iteration number when SNR was lower than the decoding threshold,but,hardly degraded the decoding performance,was proposed.The performance of the improved BP decoding algorithm was validated by stimulation.This improved BP decoding algorithm is valuable to deep space communication where small-scale equipment is required.
Iterative decoding that is adopted by near capacity limit error-correcting codes,improves the correcting capability of coding system greatly.This paper presents the design of encoding and decoding system of hamming codes with iterative decoding,and the theoretical analysis of iterative decoding process of hamming codes using modern encoding and decoding theory such as factor graph and sum-product algorithm.Simulation results show that there is 3 db coding gain between iterative decoding and classical decoding in hamming codes when the BER(bit error rate) is 10~(-3) under some times of iterative decoding and AWGN channel.At the same time,the BER performances between iterative decoding and the best enumerate decoding are equal,but the complexity of iterative decoding descends evidently,which is of importantly actual value for the hamming codes to be used in practical systems.
For short to moderate block-length LDPC codes, a large number of uncorrected error frames causes the increase of average number of iterations in the region of low SNR(Signal-to-Noise Ratio) and the oscillation of some variable nodes degrades the error performance in the region of medium to high SNR. In order to reduce the average number of iterations in the region of low SNR and improve error performance in the region of medium to high SNR, an iterative decoding algorithm with channel adaptation is proposed. The decoding method with pre-decision making based on error patterns of check-sum and weighted average message is adopted in this algorithm. Through the primary role of early decision method on reducing average iterations at low SNR and weighted average message on reducing error frames at medium to high SNR, iterative decoding with channel adaptation is realized and high efficient decoding is achieved. Simulation results show that, with the proposed algorithm, the average number of iterations is reduced in the region of low SNR without noticeable error performance degradation, and the error performance is improved in the region of medium to high SNR without obvious increase of the number of iterations compared with standard BP algorithm.
In conventional satellite broadcasting systems,e.g.DVB-S2,the error-correction schemes are often based on the concatenation of BCH and low-density parity-check(LDPC) codes,so as to obtain excellent bit error rate(BER) performance.As the inner codes,LDPC codes are traditionally decoded by iterative algorithms with many iteration cycles.In virtue of the concatenated structure of BCH and LDPC codes,a novel iterative decoding structure involving the embedment of BCH error-check function into each iterative cycle of LDPC is proposed.Computer simulations show that the iteration number of LDPC decoding with the proposed algorithm is obviously smaller than with traditional algorithm,thus greatly lowering the additional complexity of BCH error-check codes.Therefore,the total complexity and latency of the iterative decoding could be sufficiently reduced,while the similar system BER performance is maintained.
This paper discusses codes, and a decoding method, that can correct compound errors containing a mix of random and burst errors. Specifically, the paper provides a minimum compound distance that represents a compound error correcting capacity for iterated codes, proposes a compound error correcting decoding algorithm for the code, and demonstrates that the decoding algorithm is capable of correcting compound errors up to half the minimum compound distance of the code. The proposed decoding algorithm is a generalized decoding method in which the decoding method for iterated codes indicated by Reddy and Robinson is a particular case. By this generalization, the proposed decoding algorithm can correct compound errors that cannot be corrected by conventional decoding methods. © 2005 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 89(1): 60–72, 2006; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20035