%0 Journal Article
	%A Insah Bhurtah and  P. Clarel Catherine and  K. M. Sunjiv Soyjaudah
	%D 2013
	%J International Journal of Electrical and Computer Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 76, 2013
	%T Enhancing the Error-Correcting Performance of LDPC Codes through an Efficient Use of Decoding Iterations
	%U https://publications.waset.org/pdf/691
	%V 76
	%X The decoding of Low-Density Parity-Check (LDPC) codes is operated over a redundant structure known as the bipartite graph, meaning that the full set of bit nodes is not absolutely necessary for decoder convergence. In 2008, Soyjaudah and Catherine designed a recovery algorithm for LDPC codes based on this assumption and showed that the error-correcting performance of their codes outperformed conventional LDPC Codes. In this work, the use of the recovery algorithm is further explored to test the performance of LDPC codes while the number of iterations is progressively increased. For experiments conducted with small blocklengths of up to 800 bits and number of iterations of up to 2000, the results interestingly demonstrate that contrary to conventional wisdom, the error-correcting performance keeps increasing with increasing number of iterations.

	%P 448 - 451