检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘云志[1] 俞石云[1] 潘亚汉[1] 王海燕[2]
机构地区:[1]总参第六十三研究所,南京210007 [2]江苏省经贸职业技术学院信息技术系,南京210007
出 处:《信号处理》2010年第12期1819-1824,共6页Journal of Signal Processing
基 金:中国博士后科学基金资助项目(No.20070421039);中国博士后科学基金特别资助项目(No.200902699)
摘 要:针对跳频通信系统所使用的恒功率算法(CPA)存在的问题:收敛性较差和误捕干扰,结合跳频信号解跳后的恒功率特性和循环平稳特性,提出了一种新的循环相关约束差分恒功率算法(CCDCPA)。建立了合理的阵列权矢量代价函数,详细推导了该种算法的迭代公式。仿真结果表明,CCDCPA算法不仅收敛性优于CPA算法,而且可以抑制窄带干扰和宽带干扰,是一种特别适用于跳频通信系统的盲波束形成算法。Constant power algorithm(CPA) is a blind beamforming algorithm used in frequency-hopping spread spectrum(FHSS) communication systems.However,it suffers two problems.One is that its convergence speed is slow because the target power value needs to be included in the cost function to be optimized as a parameter.Another problem is that it may capture constant power(CP) interference rather than the CP signal of interest(SOI) when such interference as wideband interference or tracking interference in the environment is CP.In order to overcome the shortages,this paper proposes a novel beamforming algorithm,named Differential Constant Power Algorithm with Cycl-correlation Constrains(CCDCPA),which combined two characters of the de-hopped frequency-hopping signals, that is constant power character and cyclostationary character.A reasonable cost function of the array vector is established followed with the deduced iterative formula in this paper.The simulation results show that convergence of the proposed algorithm is faster than that of CPA.Moreover,the proposed algorithm can effectively suppress not only narrowband interference but also wideband interference. Thus,it is an appropriate blind beamforming algorithm used in frequency-hopping system.
关 键 词:跳频通信系统 阵列信号处理 循环平稳 恒功率算法
分 类 号:TN914.4[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.173.156