期刊文献+

一种短小的高码率LDPC码设计 被引量:1

Construction of High Rate LDPC Codes with Short Block Length
下载PDF
导出
摘要 提出一种高码率系统—–LDPC码的构造方法.在列重量一定的情况(通常列重量Wc3)下,构造满足给定围长条件的子矩阵,然后将该子矩阵和单位阵合并成LDPC码的校验矩阵.构造了28×76和64×328的校验矩阵.仿真表明,这两个LDPC码与校验矩阵为42×105、170×425、66×330的LDPC码在AWGN信道下的性能相比具有更好的BER.同时还基于拟阵理论给出了Tanner图的围长的充分条件,可用来构造给定的短围长LDPC码.短的高码率LDPC码可用于未来的手持数字视频广播. A method of constructing low-density parity-check (LDPC) codes is presented, where an identity matrix is combined with another sub-matrix constructed under the condition of a given girth and fixed weight of column to generate a parity check matrix. Let Wc denote the fixed weight of column, which is usually not less than 3. Two kinds of check matrices sized 28~76 and 64~328 are constructed. Simulation results over additive white Gaussian noise (AWGN) channels show that performance of the codes is better than that of check matrices sized 42x105, 170x425 and 66x330. Meanwhile, sufficient conditions for the girth of Tanner graph based on Matroid theory are present. The girth conditions can be used to construct LDPC codes with given short girths. High-rate LDPC codes with short block length can be applied to the future digital video broadcast-handsets.
作者 巫光福 王琳
出处 《应用科学学报》 CAS CSCD 北大核心 2013年第6期559-563,共5页 Journal of Applied Sciences
基金 国家自然科学基金(No.60972053)资助
关键词 高码率 误码率 编码增益 LDPC短码 围长条件 high rate, bit error rate, coding gain, low-density parity-check codes with short block length, girth condition
  • 相关文献

参考文献14

  • 1GALLAGER R G. Low-density parity check codes [M]. Cambridge, MA: MIT press, 1963.
  • 2SIPSER M, SPIELMAN D A. Expander codes [J]. IEEE Transactions on Information Theory, 1996, 42(11): 1710-1722.
  • 3SPIELMAN D A. Linear-time encodable and decod- able error-correcting codes [J]. IEEE Transactions on Information Theory, 1996, 42(11): 1723-1731.
  • 4MACKAY D J C, NEAL R M. Near Shannon limit performance of low density parity check codes [J]. Electronics Letters, 1997, 33(6): 457-458.
  • 5MACKAY D J C. Good error correcting codes based on very sparse matrices [J]. IEEE Transactions on Information Theory, 1999, 45(2): 399-431.
  • 6Kou Y, LIN S, FOSSORIER M P C. Low-density parity-check codes based on finite geometries: a re- discovery and new results [J]. IEEE Transactions on Information Theory, 2001, 47(7): 2711-2736.
  • 7HUANG Q, DIAO Q, LIN S, ABDEL-GHAFFAR K. Cyclic and quasi-cyclic LDPC codes on constrained parity- check matrices and their trapping sets [J]. IEEE Transactions on Information Theory, 2012, 58(5): 2648-2671.
  • 8ASAMOV T, AYDIN N. LDPC codes of arbitrary girth [C]//Canadian Workshop on Information Theory, 2007: 69-72.
  • 9TANNER a. A recursive approach to low complexity codes [J]. IEEE Transactions on Information Theory, 1981, 27(5): 533-547.
  • 10O'SULLIVAN M E. Algebraic construction of sparse matrices with large girth [J]. IEEE Transactions on Information Theory, 2006, 52(2): 718-727.

同被引文献4

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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