期刊文献+

一种新的卷积码自由距离计算方法 被引量:1

A New Algorithm for Computing Free Distances of Convolutional Codes
下载PDF
导出
摘要 文中重新分析了卷积码的构成方式,将其总结为一个随机序列抽样处理问题,定义了冲激响应同时给出了一个基本规则,在此基础上得到一种简单易行的自由距离计算方法,有很强的实用性。 Convolutional code is studied from the point of stochastic sequence procesing.Based this,an optimal algorithm is presented for computing the free distance.Computational results indicate that this algorithm is effective and applied.
机构地区 空军工程大学
出处 《弹箭与制导学报》 CSCD 北大核心 2005年第S4期415-417,共3页 Journal of Projectiles,Rockets,Missiles and Guidance
关键词 卷积码 自由距离 随机序列处理 convolutional code free distance stochastic sequence processing
  • 相关文献

参考文献3

二级参考文献19

共引文献19

同被引文献12

  • 1彭万权,冯文江,陈林.乘积码基于相关运算的迭代译码[J].电路与系统学报,2006,11(4):26-30. 被引量:10
  • 2王新梅 肖国镇.纠错码原理与方法[M].西安:西安电子科技大学出版社,1996..
  • 3ROBINSON J,BERNSTEIN A.A class of binary recurrent codes with limited error propagation[J].IEEE Transactions on Informational Theory,1967,13(1):106-113.
  • 4MASSEY J,COSTLLO D.Nonsystematic convolutional codes for sequential decoding in space applications[J].IEEE Transactions on Communication Theory,1971,19(5):806-813.
  • 5BRIAN C.Complementary punctured-pair convolutional codes for digital audio broadcasting[J].IEEE Transactions on Communication Theory,2000,48(11):1829-1839.
  • 6林舒.差错控制编码[M].北京:机械工业出版社,2007.384-394.
  • 7BERROU C,GLAVIEUX A.Near optimum error correcting coding and decoding:turbo-codes[J].IEEE Transactions on Communication Theory,1996,44(10):1261-1271.
  • 8TANNER 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.
  • 9KATSIOTIS A,RIZOMILIOTIS P,et al.New constructions of high-performance low-complexity convolutional codes[J].IEEE Transactions on Communication Theory,2010,58(7):1950-1961.
  • 10PUSANE 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.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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