期刊文献+

基于BIBD的多进制准循环LDPC码构造

Construction of nonbinary quasi-cyclic LDPC codes based on balanced incomplete block designs
下载PDF
导出
摘要 随机多进制低密度奇偶校验码(low-density parity-check,LDPC)的编码相当复杂,而具有特定结构的准循环LDPC码具有线性复杂度编码的特点。提出基于均衡不完全区组设计(balanced incomplete block design,BIBD)的具有高性能且能有效编码的多进制准循环LDPC码代数构造方法,构造出的多进制校验矩阵非零值的位置和数值分别建立于2个不同的域。结合BIBD和新定义的多进制位置向量进行广义二维扩展生成素数大小的多进制准循环矩阵,由此构造出的3类多进制LDPC码girth均不小于6。仿真结果表明,采用FFTQSPA对构造的LDPC码进行译码,在AWGN信道下相比于同等比特长度同等码率的RS码来说可以取得明显的编码增益。 The encoding complexity of quasi-cyclic (QC) low-density parity-check (LDPC) codes with special structure is linear while that of computer-generated random nonbinary LDPC codes is rather high. The algebraic method for constructing high performance and efficiently encodable nonbinary QC LDPC codes based on balanced incomplete block designs (BIBD) is presented. The position and the value of non -zeros are selected from two various Galois fields. A prime-size nonbinary circulant matrix is formed using generalized two dimensional dispersions considering BIBD and defined nonbinary location vector. The codes constructed by this method have girths at least 6. Experimental results show that with iterative decoding using a fast Fourier transform based sum-product algorithm, they achieve significant coding gains over reed- solomon codes of the same bit lengths and rates over the AWGN channel.
机构地区 中国人民解放军
出处 《舰船科学技术》 北大核心 2014年第2期60-65,71,共7页 Ship Science and Technology
基金 国家863高技术计划基金资助项目(2010AA7010422)
关键词 均衡不完全区组 纠错 迭代译码 多进制位置向量 多进制低密度奇偶校验码 准循环 balanced incomplete block design error correction iterative decoding nonbinary location vector nonbinary low-density parity-check (LDPC) codes quasi-cyclic
  • 相关文献

参考文献10

  • 1DAVEY M C, MACKAY D J C. Low-density parity check codes over GF (q) [ J ]. IEEE Communications Letters, 1998,2(6) :165 - 167.
  • 2BARNAULT L, DECLERCQ D. Fast decoding algorithm for LDPC over GF ( 2q ) [ C ]//IEEE Information Theory Workshop. Paris, France : IEEE,2003:70 - 73.
  • 3MACKAY D J C. Good error-correcting codes based on very sparse matrices [ J ]. IEEE Transactions on Information Theory, 1999,45 ( 2 ) :399 - 431.
  • 4DIAO Q, ZHOU W, LIN S, et al. A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes [ C //2012 Information Theory and Applications Workshop. San Diego, USA : IEEE ,2012:204 - 211.
  • 5ZENG L,LAN L,TAI Y Y,et al. Constructions of non-binary quasi-cyclic LDPC codes : A finite field approach [ J ]. IEEE Transactions on Communieations ,2008,56 (4) :545 - 554.
  • 6HUANG Q, DIAO Q, LIN S, et al. Cyclic and quasi-cyclic LDPC codes on constrained parity-cheek matrices and their trapping sets [ J ]. IEEE Transactions on Information Theory ,2012,58 ( 5 ) :2648 - 2671.
  • 7CHEN C, BAI B, WANG X. Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set[ J ]. IEEE Communications Letters, 2010,14 (2):181-183.
  • 8KOU Y, LIN S, FOSORIER M P C. Low-density parity-check codes based on finite geometries :A rediscovery and new results [ J ]. IEEE Transactions on Information Theory, 2001,47 ( 7 ) : 2711 - 2736.
  • 9AMMAR B, HONARY B, KOU Y,et al. Construction of low- density parity-check codes based on balanced incomplete block designs [ J ]. IEEE Transactions on Information Theory, 2004,50(6) :1257 - 1269.
  • 10LAN L,TAI Y Y,LIN S,et al. New constructions of quasi- cyclic LDPC codes based on special classes of BIBD's for the AWGN and binary erasure channels [ J ]. IEEE Transactions on Communications,2008,56( 1 ) :39 -48.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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