Paper Info
Title
Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices
Abstract
In this paper, decoding of LDPC convolutional codes with rational parity-check matrices (LDPC-CC-RPCM) is investigated. We show that Tanner graph of every LDPC-CC-RPCM can always be transformed into an equivalent one with enlarged girth and finite memory order suitable for practical pipeline decoder. Based on the transformed graph, a dynamic scheduling-aided decoding scheme with the enhancement of signal perturbation and error cancellation is presented to improve the convergence speed and bit-error-rate performance in both of the waterfall and error-floor regions. Simulation results also reveal that LDPC-CC-RPCM may outperform ordinary LDPC-CC with polynomial parity-check matrices in some cases under the same code rate and decoding complexity.
Year
DOI
Venue
2011
10.1109/ISIT.2011.6033864
ISIT
Keywords
Field
DocType
code rate,polynomial parity-check matrix,error cancellation,error-floor region,convergence speed,signal perturbation,rational parity-check matrix,waterfall region,dynamic scheduling-aided decoding strategy,decoding complexity,tanner graph,error statistics,parity check codes,ldpc convolutional code,decoding,convolutional codes,bit-error-rate performance,bit error rate,dynamic scheduling,convolutional code
Discrete mathematics,Combinatorics,Concatenated error correction code,Convolutional code,Sequential decoding,Low-density parity-check code,Computer science,Turbo code,Serial concatenated convolutional codes,Tanner graph,List decoding
Conference
ISSN
ISBN
Citations 
2157-8095 E-ISBN : 978-1-4577-0594-6
978-1-4577-0594-6
0
PageRank 
References 
Authors
0.34
14
5
Name
Order
Citations
PageRank
Jian-Jia Weng153.23
Mu-Chen Wu2142.64
Chung-Hsuan Wang39515.98
Yi-Sheng Su4488.42
Tsung-Cheng Wu5205.14