基于walsh-hadamard算法的扩频码生成多项式盲恢复算法  

Blind Recovery Algorithm of Spreading Code Feedback Polynomial Based on Walsh-hadamard Algorithm

作　　者：张呈铭 安永丽 ZHANG Cheng-ming;AN Yong-li(College of Artificial Intelligence,North China University of Science and Technology,Tangshan Hebei 063210,China)

机构地区：[1]华北理工大学人工智能学院,河北唐山063210

出　　处：《华北理工大学学报（自然科学版）》2021年第2期110-115,共6页Journal of North China University of Science and Technology：Natural Science Edition

基　　金：国家重点研发计划项目(2017YFE0135700);河北省高层次人才资助项目(A201903011);河北省自然科学基金(F2018209358);华北理工大学博士科研启动金。

摘　　要：针对在非合作通信中的扩频码为m序列的生成多项式盲恢复问题,提出了一种快速恢复方法。该方法利用了walsh-hadamard算法求解含错方程组的原理,通过walsh-hadamard变换之后得到的谱系数(向量中的各元素)来估计方程组的解。本文将这种思想其运用到盲解扩的过程中,然后通过matlab对其盲解扩过程以及该算法的性能进行仿真,仿真结果表明,该方法可在低信噪比条件下恢复扩频码的生成多项式。In view of the blind recovery of generator polynomials with m-sequence spreading codes in non-cooperative communication,a fast recovery method was proposed.The principle of the Walsh-hadamard algorithm to solve the error-containing equations was used,and the solution of the equations by obtaining the spectral coefficients after Walsh-hadamard transformationwas estimated.This idea was applied to the blind despreading process,and then the blind despreading process and the performance of the algorithm were simulated through matlab.The simulation results show that the method can recover the spreading code feedbackpolynomial under the condition of low signal-to-noise ratio.

关 键 词：walsh-hadamard 解扩 盲恢复 生成多项式 

分 类 号：TN971.1[电子电信—信号与信息处理]