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

Chai  Xian-Ming; Wei  Yue-Min; Shi Dong-Feng; Cai Kai; Huang  Zhi-Tao

doi:10.3724/SP.J.1146.2010.00028

Volume 33 Issue 2

Mar. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2011 > 33(2): 304-308

Chai Xian-Ming, Wei Yue-Min, Shi Dong-Feng, Cai Kai, Huang Zhi-Tao. A Method for Reconstruction of m Sequence Based on the Equivalence with BCH Codes[J]. Journal of Electronics & Information Technology, 2011, 33(2): 304-308. doi: 10.3724/SP.J.1146.2010.00028

Citation:

Chai Xian-Ming, Wei Yue-Min, Shi Dong-Feng, Cai Kai, Huang Zhi-Tao. A Method for Reconstruction of m Sequence Based on the Equivalence with BCH Codes[J]. Journal of Electronics & Information Technology, 2011, 33(2): 304-308. doi: 10.3724/SP.J.1146.2010.00028

Citation:

PDF( 222 KB)

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

doi: 10.3724/SP.J.1146.2010.00028 cstr: 32379.14.SP.J.1146.2010.00028

Received Date: 2010-01-12
Rev Recd Date: 2010-10-27
Publish Date: 2011-02-19

Abstract

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

FullText(HTML)

References(1)

References

[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.

Relative Articles

Supplements(0)

Cited By

Proportional views