TY - GEN
T1 - Serial scheduling algorithm of LDPC decoding
AU - Kim, Dong Ho
AU - Lee, Ye Hoon
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - LDPC decoding algorithm
KW - serial scheduling
KW - WPAN
UR - http://www.scopus.com/inward/record.url?scp=80054058113&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24082-9_46
DO - 10.1007/978-3-642-24082-9_46
M3 - Conference contribution
AN - SCOPUS:80054058113
SN - 9783642240812
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 376
EP - 383
BT - Convergence and Hybrid Information Technology - 5th International Conference, ICHIT 2011, Proceedings
T2 - 5th International Conference on Convergence and Hybrid Information Technology, ICHIT 2011
Y2 - 22 September 2011 through 24 September 2011
ER -