期刊文献+

采用二阶锥规划和压缩感知的方向图综合算法

Pattern synthesis algorithm using second-order cone programming and compressed sensing theory
下载PDF
导出
摘要 常规自适应方向图综合在求解最优权值向量时需经过复杂的广义矩阵求逆运算,计算过程繁琐,占用存储空间大。针对这一问题,提出一种采用二阶锥规划与压缩感知理论的改进自适应方向图综合算法。改进的算法将传统算法中的误差性能函数通过数学变换转换成标准二阶锥规划形式快速求解,同时应用压缩感知理论将大规模阵列权值稀疏化处理,从而得到最优天线阵列权值向量并减少训练时间。仿真结果表明,采用二阶锥规划与压缩感知的改进算法在大规模阵列天线方向图综合时求解速度快、运算精度高,且在应用压缩感知后形成的方向图有较低旁瓣,干扰方向零陷深,接近满阵时的波束性能。 In order to solve some problems such as the generalized inverse of a complex matrix consumes a lot of memory space in the conventional adaptive pattern synthesis methods,this paper proposed an improved adaptive pattern synthesis algorithm based on second-order cone programming( SOCP) and compressed sensing( CS) theory. First,the improved algorithm converted the error performance function of traditional algorithm into a standard second-order cone programming. Then,it used the compressed sensing theory in large array weights sparse processing,so as to obtain the optimal weight vector of the antenna array. The simulation results show that the improved algorithm based on SOCP and CS has faster computing speed in large-scale array antenna pattern synthesis and high computing accuracy. And the obtained pattern has better performance,lowest side lobe level and the deepest nulling steering through the application of compressed sensing.
作者 鞠文哲 夏克文 牛文佳 周巧 Ju Wenzhe;Xia Kewen;Niu Wenjia;Zhou Qiao(School of Electronic & Information Engineering,Hebei University of Technology,Tianjin 300401,China)
出处 《计算机应用研究》 CSCD 北大核心 2018年第7期2015-2017,2029,共4页 Application Research of Computers
基金 河北省自然科学基金资助项目(E2016202341) 河北省高等学校科学技术研究资助项目(BJ2014013)
关键词 自适应方向图综合 二阶锥规划 压缩感知 大规模阵列天线 阵列权值稀疏化 adaptive pattern synthesis second-order cone programming compressed sensing large-scale array antenna array weights sparse processing
  • 相关文献

参考文献6

二级参考文献75

  • 1鄢社锋,马远良.二阶锥规划方法对于时空域滤波器的优化设计与验证[J].中国科学(E辑),2006,36(2):153-171. 被引量:33
  • 2袁智皓,耿军平,金荣洪,范瑜.基于改进的粒子群算法的二维阵列天线方向图综合技术[J].电子与信息学报,2007,29(5):1236-1239. 被引量:21
  • 3尚飞,蔡亚星,张颖,高本庆.阵列天线的双种群遗传算法综合[J].电波科学学报,2007,22(2):224-228. 被引量:10
  • 4Elliott R S. Antenna theory and design[M]. Revised ed. New Jersey: John Wiley and Son, 2003.
  • 5Er M H. Linear antenna array pattern synthesis with pre-scribed broad nulls [ J ]. IEEE Transactions on Antennas and ProDatation, 1990, 38(9) : 1496 - 1498.
  • 6Isemia T, Di I P, Soldovieri F. An effective approach for the optimal focusing of array fields subject to arbitrary up- per bounds[J]. IEEE Transactions on Antennas and Prop- agation, 2000, 48(12): 1837-1847.
  • 7Bueci O M, Caccavale L, Isernia T. Optimal far-field fo- cusing of uniformly spaced arrays subject to arbitrary upper bounds in nontarget directions [ J ]. IEEE Transactions on Antennas and Propagation, 2002, 50( 11 ) : 1539 - 1554.
  • 8Guo Q, Liao G, Wu Y, et al. Pattern synthesis method for arbitrary arrays based on LCMV criterion [J ]. Elec- tronics Letters, 2003, 39(23) : 1 - 2.
  • 9He R, Xu D J, Shen F. Array pattern synthesis using sparse representation of beam pattem[J ]. Electronics Let- ters, 2012, 48(23): 1444- 1446.
  • 10Ares-Pena F J, Rodriguez-Gonzalez J A, ViUanueva-Lopez E, et al. Genetic algorithms in the design and optimization of antenna array pattems[J ]. IEEE Transactions on An- tennas and Propagation, 1999, 47(3) : 506 - 510.

共引文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部