期刊文献+

基于游程特征的线性分组码与卷积码类型识别 被引量:4

Blind Identifying of Type of Linear Block Code and Convolutional Code Based on Run Feature
下载PDF
导出
摘要 针对线性分组码与卷积码的类型识别问题,本文提出了一种基于游程特征的信道编码类型识别方法。论文从理论上分析了两种编码游程特性存在的差异,即卷积码的游程具有较好的随机性而线性码游程的随机性较差,并且线性码在信息位长度附近的游程数会发生一定的畸变。通过提取编码的游程特征,算法实现了对这两种编码类型的识别。仿真结果验证了所提识别方法的有效性和鲁棒性,表明算法具有一定的工程应用前景。 Aiming at solving the problem of recognition for the type of linear block code and the convolutional code,a method of the channel coding type recognition based on the run feature is proposed.Namely,the difference of the run feature of the linear block code and convolutional code is analyzed in theory.It shows that the randomness of the convolutional code run feature is superior to that of the linear block code,and the linear block code run number around the information bit length has a certain amount of distortion.Therefore,the code type can be identified by abstracting the run feature of these two codes.Simulation results show that the proposed method has high robustness and accurate recognition,and the method has a certain value in future engineering application.
出处 《数据采集与处理》 CSCD 北大核心 2015年第6期1205-1214,共10页 Journal of Data Acquisition and Processing
基金 国家自然科学基金(61171170)资助项目 安徽省自然科学基金青年项目(1408085QF115)资助项目
关键词 编码识别 线性分组码 卷积码 随机性 游程分布 coding identification linear block code convolutional code random run's distribution
  • 相关文献

参考文献10

二级参考文献62

  • 1郑贺,陆佩忠,胡捍英.基于二分图的乘积码迭代译码算法[J].电子与信息学报,2006,28(1):86-91. 被引量:2
  • 2邹艳,陆佩忠.关键方程的新推广[J].计算机学报,2006,29(5):711-718. 被引量:62
  • 3邹艳,陆佩忠,朱雪岭.软判决快速相关攻击新算法与应用[J].计算机研究与发展,2007,44(4):581-588. 被引量:4
  • 4Gallager R G. Low density parity check codes[J]. IRE Trans Info Theory, 1962,IT-8 : 21-28.
  • 5MacKay. Good error correcting codes based on very sparse matrices[J]. IEEE Transactions on Information Theory, 1999,IT-45 : 399-431.
  • 6Luby M G, Mitzenmacher M, Shokrollahi M A, et al. Improved low-density parity-check codes using irregular graphs and belief propagation [C]//ISIT 1998. Cambridge, MA, USA:[s.n.], 1998.
  • 7Hu Xiaoyu, Eleftheriou E, Arnold D M. Regular and irregular progressive edge-growth tanner graphs [J]. IEEE Transactions on Information Theory, 2005,51 (1) : 386-398.
  • 8吴湛击,王文博.现代信道编码与调制-理论与应用[M].北京:人民邮电出版社,2008:232-236.
  • 9Wu Zhanji, Peng Mugen, Wang Wenbo. Efficient difference-based decoding implementations of LDPC codes[J]. IEEE Communication Letter, 2008, 12 (5):383-385.
  • 10John G.Proakis.数字通信[M].北京:电子工业出版社,2006.9.

共引文献133

同被引文献29

引证文献4

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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