TY - GEN
T1 - New construction of LDPC convolutional codes
AU - Wu, Chi Jen
AU - Chou, Yi Chun
AU - Wang, Chung-Hsuan
AU - Chao, Chi Chao
PY - 2008
Y1 - 2008
N2 - In this paper, we propose a new construction of (3, t)-regular low-density parity-check convolutional codes by properly including binomial entries in the parity-check matrices. Both of the upper and lower bounds on free distance are derived for the new codes. Compared with previous constructions, our design can not only avoid codes of girth less than 8 but also provide enlarged free distances for some code rates. Simulation results show that the codes based on the new construction can achieve better bit-error-rate performance and lower error floor.
AB - In this paper, we propose a new construction of (3, t)-regular low-density parity-check convolutional codes by properly including binomial entries in the parity-check matrices. Both of the upper and lower bounds on free distance are derived for the new codes. Compared with previous constructions, our design can not only avoid codes of girth less than 8 but also provide enlarged free distances for some code rates. Simulation results show that the codes based on the new construction can achieve better bit-error-rate performance and lower error floor.
UR - http://www.scopus.com/inward/record.url?scp=52349092648&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4595145
DO - 10.1109/ISIT.2008.4595145
M3 - Conference contribution
AN - SCOPUS:52349092648
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1040
EP - 1044
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -