Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Jian Jia Weng; Chih Chieh Lai; Chung-Hsuan Wang

doi:10.1109/ISIT.2010.5513631

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Jian Jia Weng^*, Chih Chieh Lai, Chung-Hsuan Wang

^*Corresponding author for this work

Department of Electrical and Computer Engineering

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

4 Scopus citations

Abstract

Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.

Original language	English
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	789-793
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513631
State	Published - 2010
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 13 Jun 2010 → 18 Jun 2010

Publication series

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

Conference

Conference	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	13/06/10 → 18/06/10

Access to Document

10.1109/ISIT.2010.5513631

Cite this

Weng, J. J., Lai, C. C., & Wang, C.-H. (2010). Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 789-793). Article 5513631 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513631

@inproceedings{9425c81669464791b753b85fb3457ca6,

title = "Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective",

abstract = "Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.",

author = "Weng, {Jian Jia} and Lai, {Chih Chieh} and Chung-Hsuan Wang",

year = "2010",

doi = "10.1109/ISIT.2010.5513631",

language = "English",

isbn = "9781424469604",

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

pages = "789--793",

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

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

Weng, JJ, Lai, CC & Wang, C-H 2010, Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513631, IEEE International Symposium on Information Theory - Proceedings, pp. 789-793, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 13/06/10. https://doi.org/10.1109/ISIT.2010.5513631

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective. / Weng, Jian Jia; Lai, Chih Chieh; Wang, Chung-Hsuan.
2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 789-793 5513631 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

AU - Weng, Jian Jia

AU - Lai, Chih Chieh

AU - Wang, Chung-Hsuan

PY - 2010

Y1 - 2010

N2 - Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.

AB - Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.

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

U2 - 10.1109/ISIT.2010.5513631

DO - 10.1109/ISIT.2010.5513631

M3 - Conference contribution

AN - SCOPUS:77955701958

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 789

EP - 793

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

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -

Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this