Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices

Jian Jia Weng; Wu Mu-Chen Wu; Chung-Hsuan Wang; Su Yi-Sheng Su; Wu Tsung-Cheng Wu

doi:10.1109/ISIT.2011.6033864

Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices

Jian Jia Weng^*, Wu Mu-Chen Wu, Chung-Hsuan Wang, Su Yi-Sheng Su, Wu Tsung-Cheng Wu

^*Corresponding author for this work

Department of Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	1821-1825
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6033864
State	Published - 2011
Event	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8104

Conference

Conference	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/Territory	Russian Federation
City	St. Petersburg
Period	31/07/11 → 5/08/11

Access to Document

10.1109/ISIT.2011.6033864

Cite this

Weng, J. J., Mu-Chen Wu, W., Wang, C.-H., Yi-Sheng Su, S., & Tsung-Cheng Wu, W. (2011). Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 (pp. 1821-1825). Article 6033864 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2011.6033864

@inproceedings{f31362d2a31246988ca2f72647eb94f4,

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.",

author = "Weng, {Jian Jia} and {Mu-Chen Wu}, Wu and Chung-Hsuan Wang and {Yi-Sheng Su}, Su and {Tsung-Cheng Wu}, Wu",

year = "2011",

doi = "10.1109/ISIT.2011.6033864",

language = "English",

isbn = "9781457705953",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1821--1825",

booktitle = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

Weng, JJ, Mu-Chen Wu, W, Wang, C-H, Yi-Sheng Su, S & Tsung-Cheng Wu, W 2011, Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. in 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011., 6033864, IEEE International Symposium on Information Theory - Proceedings, pp. 1821-1825, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 31/07/11. https://doi.org/10.1109/ISIT.2011.6033864

Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. / Weng, Jian Jia; Mu-Chen Wu, Wu; Wang, Chung-Hsuan et al.
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 1821-1825 6033864 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices

AU - Weng, Jian Jia

AU - Mu-Chen Wu, Wu

AU - Wang, Chung-Hsuan

AU - Yi-Sheng Su, Su

AU - Tsung-Cheng Wu, Wu

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80054829733&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6033864

DO - 10.1109/ISIT.2011.6033864

M3 - Conference contribution

AN - SCOPUS:80054829733

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1821

EP - 1825

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

Weng JJ, Mu-Chen Wu W, Wang CH, Yi-Sheng Su S, Tsung-Cheng Wu W. Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 1821-1825. 6033864. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2011.6033864

Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this