Abstract:For the generator polynomial blind recognition method of binary pseudo-random sequences, it is necessary to know the polynomial’s order in advance, the algorithm with poor fault tolerance and high complexity. In this paper, the analysis matrix is first constructed according to the estimated polynomial’s order of the intercepted sequence. Then the method of Galoisian column Gaussian elimination is used to identify the order of the polynomial of the intercept sequence. Finally, the equation set is constructed according to the polynomial’s order. In order to reduce the complexity of the algorithm, the polynomials that satisfy the equations in the finite polynomial library are the generator polynomials of the intercepted sequences. The simulation results show that the proposed method can distinguish the m sequence, the Gold sequence, or other binary pseudorandom sequences, and effectively identify their own generating polynomials, and has good fault tolerance.
SUN Quanling, LÜ Hong, CHEN Wanli, et al. Research on cryptographic properties of m subsequences[J]. Application Research of Computers, 2018, 35(1): 1-6.
[6]
万哲先. 代数和编码[M]. 北京: 高等教育出版社, 2007: 257-260.
[7]
BERLEKAMP E R. Algebraic Coding Theory. McGraw-Hill Book Company[M]. New York: USA, 1968: 313-325.
[8]
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. doi: 10.1109/18.887869.
[9]
SHEN Lei and ZHAO Zhijin. Blind estimation of the pseudo-random sequences of direct sequence spread spectrum signals in multi-Path using fast ICA[C]. Pacific-Asia Conference on Circuits, Communications and Systems, IEEE Computer Society, Chengdu, 2009: 531-535.
ZU Yunxiao. The detection and recognition of m-sequence using higher-order statistical processing[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1576-1579.
ZHAO Zhijin, QIANG Fangfang, LI Miao, et al. Blind estimation of pseudo-random noise codes in NPLSC-DSSS signals based on goodness of fit test[J]. Journal of Electronics & Information Technology, 2017, 39(3): 749-753. doi: 10. 11999/JEIT160541.
ZHAO Zhijin, QIANG Fangfang, GU Xiaowei, et al. Blind estimation of pseudo-random codes in period long code spread spectrum signals by using triple correlation feature information[J]. Journal of Signal Processing, 2016, 32(6): 739-745. doi: 10.16798/j.issn.1003-0530.2016.06.014.
CHAI Xianming, WEI Yuemin, SHI Dongfeng, et al. 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.
CHAI Xianming, PENG Geng, SHI Dongfeng, et al. Generator polynomial estimation of pseudo-random sequence based on match-searching[J]. Optices and Precision Engineering, 2011, 19(9): 2222-2227. doi: 10.3788/OPE. 20111909.2222.
ZHANG Tianqi, YI Chen, ZHANG Gang, et al. Blind identification of parameters of linear block codes based on columns Gaussian elimination[J]. Systems Engineering and Electronics, 2013, 35(7): 1514-1519. doi: 10.3969/j.issn.1001- 506X.2013.07.27.