【24h】

High-Resolution Radar Ranging for Multiple Targets

机译:多个目标的高分辨率雷达测距

获取原文
获取原文并翻译 | 示例

摘要

The similarity between the multiple-target radar ranging problem and the multi-user detection problem in CDMA is drawn: in CDMA, users' bits modulate distinct but correlated signature signals; while, in radar, the "bits" are range-bin occupancies and the "signatures" correspond to the known transmitted signal translated to be centered on the appropriate range bin. The analogy is useful: there has been a great deal of recent experience in CDMA, and one of the best and fastest algorithms uses a variant of probabilistic data association (PDA, the target-tracking philosophy). PDA can be augmented by group decision feedback (GDF) ― another idea from CDMA ― to refine the target delay estimates; and finally minimum description length (MDL) is applied to estimate the number of targets. Simulation examples are given to illustrate the resolution of closely spaced targets within what would normally be thought the same range bin. Its performance is also compared with the Cramer-Rao lower bound (CRLB) and the alternating projection (AP) algorithm.
机译:得出了CDMA中多目标雷达测距问题与多用户检测问题之间的相似性:在CDMA中,用户比特调制不同但相关的签名信号。而在雷达中,“位”是测距仓的占用率,而“签名”则对应于转换为以适当测距仓为中心的已知发射信号。这个比喻是有用的:CDMA上有大量的最新经验,最好,最快的算法之一就是使用概率数据关联的一种变体(PDA,目标跟踪原理)。可以通过群决策反馈(GDF)来增强PDA,这是CDMA的另一种想法。最后,使用最小描述长度(MDL)来估算目标数量。给出了仿真示例,以说明通常认为在同一距离范围内的近距离目标的分辨率。还将其性能与Cramer-Rao下界(CRLB)和交替投影(AP)算法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号