Serial scheduling algorithm of LDPC decoding

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we consider a layered decoding algorithm for a performance improvement of LDPC. The proposed algorithm is based on a serial scheduling algorithm for the layered decoding of LDPC in which we consider check node degree, variable node degree, and the edge connection between the each node. Simulation results show that the proposed method improves about 0.2dB SNR gain compared with random schedule in a layered decoding. Especially when the number of iteration is low, the performance gain gets larger, which case is applicable to the WPAN system which requires low power consumption and low latency. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kim, D. H., & Lee, Y. H. (2011). Serial scheduling algorithm of LDPC decoding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6935 LNCS, pp. 376–383). https://doi.org/10.1007/978-3-642-24082-9_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free