Back to Search
Start Over
Sequential Message-Passing Decoding of LDPC Codes by Partitioning Check Nodes.
- Source :
-
IEEE Transactions on Communications . Jul2008, Vol. 56 Issue 7, p1025-1031. 7p. 4 Graphs. - Publication Year :
- 2008
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 56
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 33550728
- Full Text :
- https://doi.org/10.1109/TCOMM.2008.040571