期刊文献+

一种基于与BCH码等价原理的m序列重构算法 被引量:12

A Method for Reconstruction of m Sequence Based on the Equivalence with BCH Codes
下载PDF
导出
摘要 该文针对现有m序列特征多项式估计方法在高阶高误码条件下的估计效率不高,精度不够的问题展开研究,通过分析m序列和BCH码的生成原理,得出二者之间的等价关系,进而提出了一种新的m序列特征多项式的估计算法。该算法通过构造与之等价的BCH码,利用其良好的纠错性能,实现高误码条件下的m序列特征多项式的估计,仿真结果表明本算法能较好地解决误码条件下的m序列特征多项式估计问题,运算速度主要适用于通信信号处理中常用20阶以内的m序列分析问题。 The issue of insufficient efficiency and accuracy of current estimation methods for characteristic polynomial of m sequence under high error conditions is studied.A equivalent relationship between m sequence and BCH codes is derived by studying their generation principles,and then a new estimation algorithm for characteristic polynomial of m sequence is proposed in the paper.By constructing equivalent BCH codes,characteristic polynomial of m sequence is estimated using their good error-correction performance under high error conditions.Simulation results show that the algorithm can solve the estimation for characteristic polynomial of m sequence under error conditions,operation speed of the algorithm can mainly be accepted for analysis of m sequence lower than 20-order in signal processing.
出处 《电子与信息学报》 EI CSCD 北大核心 2011年第2期304-308,共5页 Journal of Electronics & Information Technology
关键词 信号处理 M序列 特征多项式 BCH码 等价 Signal processing m sequence Characteristic polynomial BCH codes Equivalence
  • 相关文献

参考文献10

  • 1Trappe Wand Washington L C著,王全龙,王鹏,林昌露泽.密码学与编码理论.北京:人民邮电出版社.2008,第3章第3节.
  • 2Berlekamp E R. Algebraic Coding Theory. McGraw-Hill Book Company[M]. New York: USA. 1968:313-325.
  • 3Heydtmann A E and aensen J M. On the equivalence of the Berlekamp Massey and the Euclidean algorithms for decoding[J]. IEEE Transactions on Information Theory, 2000 46(7): 2614-2624.
  • 4王丽萍,祝跃飞.F[x]-格基约化算法和多条序列综合[J].中国科学(E辑),2003,33(2):168-173. 被引量:2
  • 5El-Khamy S E. Efficient detection of truncated m-sequence using higher order statistics[C]. 20th National Radio Science Conference[C]. Cario Egypt. 2003, C8 1-9.
  • 6Wang Feng-hua, Huang Zhi-tao, and Zhou Yi-yu. A new method for m-sequence and gold-sequence generat, or polynomial estimation[C]. IEEE International Symposium on Microwave Antenna, Propagation and EMC Technologies for Wireless Communications, Hangzhou China, 2007: 1039-1044.
  • 7Pless V. Introduction to the Theory of Error Correcting Codes [M]. Second Edition. NewYork: Wiley, 1989: 109-117.
  • 8Cho Jun-ho and Sung Won-yong. Strength-reduced parallel chien search architecture for strong BCH codes[J]. IEEE Transactions on Circuits and Systems, 2008, 55(5): 427-431.
  • 9Zheng Jun-ru and Takayasu Kaida. Equivalence between the BCH bound and the schaub bound for cyclic codes[C]. Proceedings of IEEE Information Theory Workshop, Chengdu China, 2006: 29-32.
  • 10Shi Zhi-ping, Zhou Liang, Wen Hong, and Li Shao-qian. Iterative decoding for the concatenation of LDPC codes and BCH codes based on bhase algorithm[C]. International Conference on ITS Telecommunications Proceedings, Chengdu China, 2006: 12-15.

二级参考文献2

  • 1Don Coppersmith. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities[J] 1997,Journal of Cryptology(4):233~260
  • 2A. K. Lenstra,H. W. Lenstra,L. Lovász. Factoring polynomials with rational coefficients[J] 1982,Mathematische Annalen(4):515~534

共引文献1

同被引文献162

引证文献12

二级引证文献105

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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