%0 Electronic Article
%A R.K. Bhattar
%A K.R. Ramakrishnan
%A K.S. Dasgupta
%K a posteriori probabilities
%K code rate
%K trapping set
%K graph-based impairment
%K BP algorithm
%K coding gain
%K error correction
%K BP decoding
%K decoding failure
%K short-length regular low-density parity-check code
%K LDPC matrix
%K reliability-based estimation
%K bit node
%K bipartite graph
%K belief propagation algorithm
%K short-length LDPC code
%K oscillation
%K performance degradation
%K low-complexity postprocessing
%X It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high Eb/N0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high Eb/N0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.
%@ 1751-8628
%T Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing
%B IET Communications
%D October 2012
%V 6
%N 15
%P 2487-2496
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=3jb62epg9ro1a.x-iet-live-01content/journals/10.1049/iet-com.2011.0292
%G EN