基于FOCUSS算法的稀疏阵列综合  

Sparse Array Synthesis Based on FOCUSS Algorithm

作　　者：杨鹏[1] 闫飞[1] 张胜辉[2] 杨峰[1] 

机构地区：[1]电子科技大学电子工程学院,成都611731 [2]航天恒星科技有限公司,北京海淀区100086

出　　处：《电子科技大学学报》2014年第2期203-206,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(61301056;61231011;11176007);高等学校学科创新引智计划(B07046);中央高校基本科研业务费专项资金(ZYGX2012J010);教育部博士点基金(2012018520004)

摘　　要：以最大稀疏化阵列得到所期望的方向图是稀疏阵列综合理论中的关键问题。由于阵列天线本身具有稀疏的物理特性,因此可将稀疏阵列综合归结为稀疏信号的重建过程。该文提出一种将阵列天线的波束形成问题等效为求解稀疏信号向量的最优化问题的方法,并利用FOCUSS算法快速准确地得到最大稀疏化的阵列,以及阵元位置和激励幅度。理论分析和数值仿真表明了该方法的有效性。The use of maximally sparse array to achieve the desired radiation pattern is a key problem in sparse array synthesis theory. Since the array antenna has intrinsic character of sparsity, the sparse array synthesis problem can be seen as a process of sparse signal reconstruction. In this paper, the problem of beamforming with antenna array is proved to be the same as the optimization problem of solving sparse signal vector. By using the focal undetermined system solver （FOCUSS） algorithm, maximally sparse array as well as the elements’ locations and amplitudes are achieved quickly and accurately. The efficiency of this method is proved by theoretical analyses and numerical simulations.

关 键 词：阵列综合 FOCUSS算法 稀疏阵列 稀疏信号重建 

分 类 号：TN821.91[电子电信—信息与通信工程]