Paper Info
Title
Low Complexity Decoding Algorithm of QC-LDPC Code
Abstract
Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of the check nodes update. Therefore, it is not required to find the sub-minimum and the computational complexity reduces significantly. Matlab simulation results show that the decoding performance of this algorithm is very near to min-sum (MS) algorithm, and more superior than single min-sum (SMS) algorithm.
Year
DOI
Venue
2010
10.1109/APSCC.2010.71
APSCC
Keywords
Field
DocType
ldpc,matlab simulation,check nodes update,low-density parity-check,decoding performance,low complexity,cyclic codes,low complexity decoding algorithm,quasicyclic low density parity check code,mat lab simulation result,quasi-cyclic ldpc,computational complexity,qc-ldpc code,single min-sum,decoding algorithm,optimal correction factor,layered decoding,low-complexity decoding algorithm,parity check codes,decoding,sms algorithm,single-min-sum algorithm,signal to noise ratio,low density parity check,algorithm design and analysis,ldpc code
Average-case complexity,Algorithm design,Berlekamp–Welch algorithm,Sequential decoding,Computer science,Low-density parity-check code,Algorithm,List decoding,Iterative Viterbi decoding,Worst-case complexity
Conference
ISBN
Citations 
PageRank 
978-1-4244-9396-8
0
0.34
References 
Authors
5
2
Name
Order
Citations
PageRank
Fanglong Yi100.68
Pengjun Wang26211.93