期刊文献+

基于矩阵填充的合成宽带高频雷达非网格目标分辨技术研究 被引量:2

Off-the-grid Targets Resolution of Synthetic Bandwidth High Frequency Radar Based on Matrix Completion
在线阅读 下载PDF
导出
摘要 高频雷达由于工作在拥挤的高频频段(3~30 MHz),连续频带资源十分有限,有限的带宽限制了对目标的分辨能力。该文引入一种合成宽带的发射信号,同时针对该信号,提出一种基于矩阵填充(Matrix Completion,MC)的1维和2维目标参数估计方法,分别称之为矩阵填充1维估计(MCE-1D)和矩阵填充2维估计(MCE-2D)方法,该方法将不完备采样集合变换成低秩矩阵,通过构造双重汉克尔(two-fold Hankel)矩阵将其转化为半定规划(SemiDefinite Programming,SDP)问题求解。新方法应用于高频雷达中,可以在非连续谱的背景下获得场景中目标位置的准确估计,很好地解决了非网格目标在传统网格类方法中的基失配问题,新方法对于非网格目标具有更高的分辨能力及抗噪性能。仿真处理结果验证了该方法的有效性。 High Frequency Radar (HFR) works in the crowded high-frequency band (3-30 MHz) with limited continuous bandwidth. It affects the ability to distinguish the near targets. Therefore, this paper introduces a kind of synthesis bandwidth signal with a proposed method for estimating the target parameters in 1-D and 2-D based on Matrix Completion (MC). They are respectively named Matrix Completion Estimation for One Dimension (MCE-1D) and Matrix Completion Estimation for Two Dimensions (MCE-2D). The incomplete sampling set can be considered as low rank matrix, by constructing the two-fold Hankel matrix, this problem is transformed into a Semi-Definite Programming (SDP) problem. Using this new method to the high frequency radar, then the accurate estimation of the target position in the scene can be obtained in the background of the discontinuous spectrum, which solves the problem of base mismatch for off-the-grid targets in the traditional grid estimate method. It also has higher resolution and anti-noise performance. The simulation results demonstrate the effectiveness of this method.
出处 《电子与信息学报》 EI CSCD 北大核心 2017年第12期2874-2880,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61171182 61032011 61171180 61571159) 中央高校基本科研业务费专项资金(HIT.MKSTISP.201613 HIT.MKSTISP.201626)~~
关键词 高频雷达 目标分辨 矩阵填充 非网格 High Frequency Radar (HFR) Multi-target resolution Matrix Completion (MC) Off-the-grid
  • 相关文献

参考文献5

二级参考文献202

  • 1袁莉,刘宏伟,保铮.MUSIC超分辨距离像在雷达目标识别中的问题[J].现代雷达,2005,27(5):45-48. 被引量:3
  • 2Candes E J, Tao T. Robust uncertain typrincipless : exact signal reconstruction from highly incomplete frequency in- formation[J]. IEEE Transaction on Information Theory, 2006, 52(2) :489-509.
  • 3Candes E J, Tao T. Near optimal signal recovery from random projections : universal encoding strategy? [ J ]. IEEE Transaction on Information Theory, 2006, 52(12) : 5406-5425.
  • 4Candes E J, Tao T. Decoding by linear programming [ J ]. IEEE Transaction on Information Theory., 2005, 51 (12) : 4203-4215.
  • 5Donoho D L, Tsaig Y, Drori I, et al. Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit [ J ]. IEEE Transactions on Information Theory, 2012, 58(2) : 1094-1121.
  • 6Gan H P, Li J, Li Z, et al. Bernoulli shift chaotic se- quence for compressed sensing [ J ]. Journal of Computa- tional Information Systems, 2014, 10(7) : 2761-2768.
  • 7Liu E, Temlyakov V. Orthogonal super greedy algorithm and applications in compressed sensing[ J]. IEEE Trans- action on Information Theory, 2012, 58(4) : 2040-2047.
  • 8Douoho D L. Compressed sensing[ J]. IEEE Transac- tions on Information Theory, 2006, 52(4) : 1289-1306.
  • 9Maleki A, Donoho D L. Optimally tuned iterative recon- strnction algorithms for compressed sensing [ J ]. IEEE Journal of Selected Topics in Signal Processing, 2010, 4 (2) : 330-341.
  • 10Duate M F, Sarvotham S, Baron D, et al. Distributedcompressed sensing of jointly sparse signals [ C ]//Cofer- ence Rocord-Asilomar Conference on Signals, Systems and Computers, 2005 : 1537-1541.

共引文献28

同被引文献7

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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