一种基于与BCH码等价原理的m序列重构算法

柴先明; 魏跃敏; 师栋锋; 蔡凯; 黄知涛

doi:10.3724/SP.J.1146.2010.00028

一种基于与BCH码等价原理的m序列重构算法

doi: 10.3724/SP.J.1146.2010.00028

柴先明^{*① 魏跃敏,},
魏跃敏,
师栋锋,
蔡凯,
黄知涛

计量
- 文章访问数: 3604
- HTML全文浏览量: 103
- PDF下载量: 947
- 被引次数: 0
出版历程
- 收稿日期: 2010-01-12
- 修回日期: 2010-10-27
- 刊出日期: 2011-02-19

A Method for Reconstruction of m Sequence Based on the Equivalence with BCH Codes

摘要

摘要: 该文针对现有m序列特征多项式估计方法在高阶高误码条件下的估计效率不高，精度不够的问题展开研究，通过分析m序列和BCH码的生成原理，得出二者之间的等价关系，进而提出了一种新的m序列特征多项式的估计算法。该算法通过构造与之等价的BCH码，利用其良好的纠错性能，实现高误码条件下的m序列特征多项式的估计，仿真结果表明本算法能较好地解决误码条件下的m序列特征多项式估计问题，运算速度主要适用于通信信号处理中常用20阶以内的m序列分析问题。
- 信号处理 /
- m序列 /
- 特征多项式 /
- BCH码 /
- 等价
Abstract: 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.
- Signal processing /
- m sequence /
- Characteristic polynomia /
- BCH codes /
- Equivalence

HTML全文

参考文献(1)

[1] Trappe W and Washington L C著. 王全龙, 王鹏, 林昌露译. 密码学与编码理论. 北京: 人民邮电出版社, 2008, 第3章第3节. [2] 刘焕淋, 向劲松, 代少升. 扩展频谱通信. 北京: 北京邮电大学出版社, 2008, 第4章第3节. [3] 吴迪. 直扩信号的快速同步技术研究[D]. [硕士论文, 南京理工大学, 2009. [4] Berlekamp E R. Algebraic Coding Theory. McGraw-Hill Book Company[M]. New York: USA, 1968: 313-325. [5] Heydtmann A E and Jensen 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 [6] 王丽萍，祝跃飞. F[x]-格基约化算法和多条序列综合[J]. 中国科学E辑, 2003, 33(2): 168-173. [7] El-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. [8] Wang Feng-hua, Huang Zhi-tao, and Zhou Yi-yu. A new method for m-sequence and gold-sequence generator polynomial estimation[C]. IEEE International Symposium on Microwave Antenna, Propagation and EMC Technologies for Wireless Communications, Hangzhou China, 2007: 1039-1044. [9] Pless V. Introduction to the Theory of Error Correcting Codes [M]. Second Edition. NewYork: Wiley, 1989: 109-117. [10] Cho 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 [11] Zheng 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. Shi 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.

施引文献

资源附件(0)

访问统计