期刊文献+

基于PEG算法的准循环LDPC码构造研究 被引量:1

Research on Construction of Quasi-Cyclic LDPC Codes Based on PEG Algorithm
下载PDF
导出
摘要 为了兼顾LDPC码较高的纠错性能和较简单的硬件实现,提出了一种基于PEG算法的准循环LDPC码校验矩阵的构造方法,该方法首先利用PEG算法构造基矩阵,然后利用提出的移位参数公式来构造循环移位矩阵,再用循环移位矩阵和全零矩阵对基矩阵进行优化扩展,形成的校验矩阵最短环长至少为8环。该方法具有与PEG算法非常接近的纠错性能,尤其是当信噪比高于1.2 dB时要优于PEG直接构造法,而硬件实现比PEG算法简单,且参数选择灵活方便。 In order to take into account the requirements of high error correction performance and simple hardware implementation of LDPC codes, this paper presents a new algorithm for constructing check matrix of LDPC codes based on PEG algorithm. After constructing a basic matrix with PEG algorithm, we can get cyclic shift matrix under the proposed formula of shift parameter, and then, using the cyclic shift matrix and all-zero matrix to extend the basic matrix optimally, we can get the quasi-cyclic LDPC matrix in which the girth is 8 at least. The algorithm's error correction performance is very close to that of PEG algorithm, and is particularly better than that of PEG algorithm when SIN is higher than 1.2 dB. It's hardware implementation is more simple than that of PEG algorithm, and the algorithm is flexibly to set the parameters of the LDPC codes.
作者 张建斌
出处 《电子器件》 CAS 北大核心 2012年第6期647-651,共5页 Chinese Journal of Electron Devices
基金 江苏省自然科学基金项目(BK2012584) 常州市应用基础研究计划项目(CJ20110025)
关键词 准循环LDPC码 校验矩阵 PEG算法 树图 环长 MATLAB软件 quasi-cyclic LDPC codes check matrix PEG algorithm tree girth MATLAB software
  • 相关文献

参考文献10

  • 1Gallager R G.Low-Density Parity-Check Codes[D].Cambridge,MA:M.I.T.Press,1963.
  • 2MacKay D J C,Neal R M.Near Shannon Limit Performance of Low Density Parity Check Codes[J].Electronics Letters,1996 (8):1645-1646.
  • 3杨华,田应洪,张小军,陈磊,赖宗声.基于范德蒙矩阵的LDPC码构造[J].电子器件,2009,32(2):413-416. 被引量:2
  • 4Tanner R M.A Recursive Approach to Low Complexity Codes[J].IEEE Transactions On Information.Theory,1981 (9):533-547.
  • 5张焕明,叶梧,冯穗力.LDPC码的树图法构造[J].电讯技术,2007,47(4):166-168. 被引量:2
  • 6Xiao Yu Hu,Elefthefiou E,Arnold D M.Regular and Irregular Progressive Edge-Growth Tanner Graphs[J].IEEE Trans.Info.Theory,2005 (1):386-398.
  • 7Mackay D J C.Good Error-Correcting Codes Based on Very Sparse Matrices[J].IEEE Trans.Info.Theory,Vol.IT-45,1999 (3):399-431.
  • 8Fossorier M.Quasicyclic Low Density Parity Check Codes[J].IEEE Trans.Inform.Theory,2005 (8):1788-1793.
  • 9管武,项海格.具有大码间距和大环路的QC-LDPC码的构造[J].电路与系统学报,2011,16(4):1-5. 被引量:4
  • 10Richardson T,Urbanke R.Efficient Encoding of Low-Density ParityCheck Codes[J].IEEE Trans.Info.Theory,2001 (2):638-656.

二级参考文献22

  • 1彭立,朱光喜.基于Q-矩阵的LDPC码编码器设计[J].电子学报,2005,33(10):1734-1740. 被引量:15
  • 2Galtager R G. Low Desity Parity Check Codes[D]. Cambrige, MA:MIT, 1960.
  • 3MacKay David J C. Good Error-Correcting Codes Based on Very Sparse Matrices[J]. IEEE Tran on Information Theory, 1999,45(2) : 399-431.
  • 4COOLSAET K. Cyclic Difference Sets[EB/OL]. http://www. inference. phy. cam.ac. uk/cds.
  • 5Shu Lin,Daniel J.Costello,Jr.晏坚,何元智,潘亚汉等.Error Control Coding(Second Edition)[M].北京:机械工业出版,2007.
  • 6Shu Lin, Lei Chen, Jun Xu, Ivana Djudjevic. Near Shannon Limit Quasi Cyclic Low Density Parity-Check Codes[C]// GLOBECOM'03. IEEE, 2003, Vol. 4 : 2030-2035.
  • 7D J C MacKay, R M Neal. Near Shannon limit performance of low-density parity-check codes [J]. Electron. Lett., 1996, 32(18): 1645.
  • 8ETSI EN 302 307, Second Generation Framing Structure, Channel Coding and Modulation System for Broadcasting, Interactive Services, News Gathering and Other Broadband Satellite Applications [Z]. 2004.
  • 9IEEE Std. 802.16e, IEEE Standard for Local and metropolitan area networks Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, Amendment 2: Physical and Medium Access Control Layer for Combined Fixed and Mobile Operation in Licensed Bands [S]. 2006.
  • 10S Y Chung, T J Richardson, R L Urbanke. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J]. IEEE Trans. Inf. Theory, 2001, 47(2): 657-670.

共引文献3

同被引文献3

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部