一种新的准随机LDPC卷积码及窗译码

doi:10.3969/j.issn.0372-2112.2014.07.021

电子学报 ›› 2014, Vol. 42 ›› Issue (7): 1379-1386.DOI: 10.3969/j.issn.0372-2112.2014.07.021

一种新的准随机LDPC卷积码及窗译码

彭万权¹, 伍小兵¹, 张承畅², 冯文江²

1. 重庆工程职业技术学院电气工程学院, 重庆 400037;
2. 重庆大学通信工程学院, 重庆 400044

收稿日期:2013-09-18 修回日期:2014-03-04 出版日期:2014-07-25
- 作者简介:
- 彭万权 男，1974年生于重庆垫江.2005年在重庆大学通信工程学院获得工学硕士学位，现为重庆工程职业技术学院副教授，主要从事纠错码的算法研究工作.E-mail：408502@163.com；伍小兵 男，1968年生于重庆开县，2008年在重庆大学电气工程学院获硕士学位，现为重庆工程职业技术学院教授，主要从事电工理论与新技术研究工作.E-mail：wxb@cqvie.edu.cn
- 基金资助:
- 重庆市基础与前沿研究计划 (No.cstc2013jcyjA40055）; 重庆市教委科学技术研究项目 (No.KJ122003）; 中央高校基本科研业务费 (No.CDJZR12160019）

A New Quasi-Random LDPC Convolutional Codes and Window Decoding

PENG Wan-quan¹, WU Xiao-bing¹, ZHANG Cheng-chang², FENG Wen-jiang²

1. College of Electrical Engineering, Chongqing Vocational Institute of Engineering, Chongqing 400037, China;
2. College of Communication Engineering, Chongqing University, Chongqing 400044, China

Received:2013-09-18 Revised:2014-03-04 Online:2014-07-25 Published:2014-07-25
- Supported by:
- Chongqing Research Program of Basic and Frontier Technology (No.cstc2013jcyjA40055); Science and Technology Research Program of Chongqing Municipal Education Commission (No.KJ122003); Fundamental Research Funds for the Central Universities (No.CDJZR12160019)

摘要/Abstract

摘要：

以Gallager随机LDPC分组码为基础，通过列置换、置数、剪切与合并，构造了一种新的（l，3，6）准随机LDPC卷积码.针对该码类，提出了一种窗扇尺寸固定、滑动步长可选的窗译码算法，大幅降低了寄存器开销和译码延时.仿真实验界定了滑动步长的取值范围，验证了构造方案和窗译码的有效性，测试了不同约束度的准随机LDPC卷积码的误码性能，结果显示约束度l仅为1535即可获得距离香农限约1dB的纠错能力.

关键词: 卷积码, 低密度校验码, 时变周期卷积码, 流水线译码, 窗译码

Abstract:

Using column permutation,number setting,cutting and merging,a new(l,3,6)quasi-random LDPC convolutional codes is derived from Gallager LDPC block code.Aiming at this codes,the paper advances a windowed decoding,which the size of window sash is invariable and sliding step is optional,and it can considerably reduce the size of the register and decoding delay.The simulation defines the value range of sliding step and confirms the effectiveness of the construction method and windowed decoding,and also tests the BER performance of quasi-random LDPC convolutional codes with different constraint degrees.The results show that l=1535 can obtain an error-correcting ability about 1 dB from the capacity limit.

Key words: convolutional codes, low-density parity-check codes, time-varying periodic convolutional codes, pipeline decoding, windowed decoding

中图分类号:

TN911.22

彭万权, 伍小兵, 张承畅, 等. 一种新的准随机LDPC卷积码及窗译码[J]. 电子学报, 2014, 42(7): 1379-1386.

PENG Wan-quan, WU Xiao-bing, ZHANG Cheng-chang, et al. A New Quasi-Random LDPC Convolutional Codes and Window Decoding[J]. Acta Electronica Sinica, 2014, 42(7): 1379-1386.

参考文献

[1] Jimenez Felstrom A,Zigangirov K S.Time-varying periodic convolutional codes with low-density parity-check matrix[J].IEEE Transactions on Informational Theory,1999,45(6):2181-2191.
[2] Tanner R M,Sridhara D,et al.LDPC block and convolutional codes based on circulant matrices[J].IEEE Transactions on Informational Theory,2004,50(12):2966-2984.
[3] Pusane A E,Smarandache R,et al.Deriving good LDPC convolutional codes from LDPC block codes[J].IEEE Transactions on Informational Theory,2011,57(2):835-857.
[4] Liwei Mu,Xingcheng Liu,Chulong Liang.Construction of binary LDPC convolutional codes based on finite fields[J].IEEE Communications Letters,2012,16(6):897-900.
[5] Chiu-Wing Sham,Xu Chen,Lau F C M,Yue Zhao,Tam W M.A 2.0 Gb/s throughput decoder for QC-LDPC convolutional codes[J].IEEE Transactions on Circuits and Systems I,2013,60(7):1857-1869.
[6] 张国华,王新梅.围长至少为8的QC-LDPC码的新构造:一种显式框架[J].电子学报,2012,40(2):331-337. Zang Guohua,Wang Xinmei.Novel constructions of QC-LDPC codes with girth at least eight:an explicit framework[J].Acta Electronica Sinica,2012,40(2):331-337.(in Chinese)
[7] Massey J,Costello D,Justesen J.Polynomial weights and code constructions[J].IEEE Transactions on Informational Theory,1973,19(1):101-110.
[8] Iyengar A R,Papaleo M,et al.Windowed decoding of protograph-based LDPC convolutional codes over erasure channels[J].IEEE Transactions on Informational Theory,2012,58(4):2303-2320.
[9] Mitchell D G M,Pusane A E,Costello D J.Minimum distance and trapping set analysis of protograph-based LDPC convolutional codes[J].IEEE Transactions on Informational Theory,2013,59(1):254-281.
[10] Hosung Park,Seokbeom Hong,Jong-Seon No,Dong-Joon Shin.Design of multiple-edge protographs for QC LDPC codes avoiding short inevitable cycles[J].IEEE Transactions on Informational Theory,2013,59(7):4598-4614.
[11] Lee P J.There are many good periodically time-varying convolutional codes[J].IEEE Transactions on Informational Theory,1989,35(2):460-463.
[12] Bates S,Zhengang Chen,Xiaodai Dong.Low-density parity check convolutional codes forEthernet networks[A].Proceedings of IEEE Pacific Rim Conference on Communications,Computers and signal Processing[C].Victoria,BC,Canada:IEEE,2005.85-88.
[13] Pusane A E,Feltstrom A J,et al.Aspects of LDPC convolutional codes[J].IEEE Transactions on Communications,2008,56(7):1060-1069.
[14] Papaleo M,Iyengar A R,et al.Windowed erasure decoding of LDPC convolutional codes[A].IEEE Information Theory Workshop[C].USA:IEEE,2010.1-5.
[15] 彭万权,张承畅.多阶幻方卷积码的构造及译码[J].电子学报,2013,41(1):123-130. Peng Wanquan,Zhang Chengchang.Construction and decoding of high order magic square convolutional codes[J].Acta Electronica Sinica,2013,41(1):123-130.(in Chinese)
[16] 吴湛击,王文博.现代纠错编码与调制理论及应用[M].北京:人民邮电出版社,2008.232-238. Wu Zhanji,Wang Wenbo.Modern Channel Coding and Modulation:Theory and Application[M].Beijing:Posts & Telecom Press,2008.232-238.(in Chinese)
[17] Berrou C,Glavieux A.Near optimum error correcting coding and decoding:turbo-codes[J].IEEE Transactions on Communications,1996,44(10):1261-1271.
[18] 肖扬.Turbo与LDPC编解码及其应用[M].北京:人民邮电出版社,2010.19-21. Xiao Yang.Turbo and LDPC:Coding,Decoding and Application[M].Beijing:Post & Telecom Press,2010.19-21.(in Chinese)
[19] MacKay D J C.Good error-correcting codes based on very sparse matrices[J].IEEE Transactions on Informational Theory,1999,45(2):399-431.
[20] Fossorier M P C,Mihaljevic M,Imai H.Reduced complexity iterative decoding of low density parity check codes based on belief propagation[J].IEEE Transactions on Communications,1999,47(5):673-680.
[21] Jinghu Chen,A Dholakia,E Eleftheriou,M P C Fossorier,Xiao-Yu Hu.Reduced-complexity decoding of LDPC codes[J].IEEE Transactions on Communications,2005,53(8):1288-1299.
[22] 刘原华,王新梅,等.一种改进的卷积LDPC码置信传播译码算法[J].西安电子科技大学学报,2009,36(3):424-428. Liu Yuanhua,Wang Xinmei,et al.Improved belief propagation algorithm for decoding of convolutional LDPC codes[J].Journal of Xidian University,2009,36(3):424-428.(in Chinese)

一种新的准随机LDPC卷积码及窗译码

A New Quasi-Random LDPC Convolutional Codes and Window Decoding

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

编辑推荐

Metrics

[1]	吴昭军, 张立民, 钟兆根, 刘仁鑫. 基于迭代消元的卷积码快速识别[J]. 电子学报, 2021, 49(6): 1108-1116.
[2]	韩树楠, 张旻, 李歆昊. 基于m序列三阶相关性的同步扰码反馈多项式重构[J]. 电子学报, 2019, 47(3): 552-559.
[3]	于沛东, 彭华, 巩克现, 陈泽亮. 基于最小二乘代价函数的卷积码盲识别方法[J]. 电子学报, 2018, 46(7): 1545-1552.
[4]	陈泽亮, 巩克现, 彭华, 于沛东. 基于软信息的分组交织和卷积码联合识别[J]. 电子学报, 2018, 46(6): 1454-1460.
[5]	彭万权, 张承畅, 冯文江. 卷积码基于逃逸机制的次优译码[J]. 电子学报, 2014, 42(4): 828-832.
[6]	解辉, 黄知涛, 王丰华. 信道编码盲识别技术研究进展[J]. 电子学报, 2013, 41(6): 1166-1176.
[7]	彭万权, 张承畅, 冯文江, 伍小兵. 多阶幻方卷积码的构造及译码[J]. 电子学报, 2013, 41(1): 123-130.
[8]	乔华;董明科;项海格. 一种基于MDS-卷积码的LDPC码构造方法[J]. 电子学报, 2008, 36(1): 117-121.
[9]	刘培;葛建华;刘刚. 级联卷积码的性能评估[J]. 电子学报, 2003, 31(7): 1089-1091.
[10]	袁东风;李作为;隋爱芬;宁继鸣. 移动信道下采用Punctured卷积码实现不等错误保护的研究[J]. 电子学报, 2001, 29(7): 996-999.
[11]	隋爱芬;袁东风;李作为;杨义先. 衰落信道下卷积码的软判决译码[J]. 电子学报, 2001, 29(6): 849-852.
[12]	陈军;孙韶辉;王新梅;曹志刚. 基于遗传算法的卷积码快速译码[J]. 电子学报, 2000, 28(9): 137-139.