首页> 外文会议> >A modified quasi-best weighted order statistics CFAR algorithm with greatest of selection
【24h】

A modified quasi-best weighted order statistics CFAR algorithm with greatest of selection

机译:一种选择最多的改进的拟最佳加权阶数统计CFAR算法

获取原文

摘要

In order to improve the performance of OSGO or GOSGO, a CFAR algorithm based on quasi best weighted (QBW) order statistics CFAR method is proposed in this paper. The analytic results show that the performance of QBWGO is evidently superior to that of OSGO or GOSGO both in a homogeneous background and in multiple target situations. If the number of interfering targets is 4, the CFAR loss of QBWGO is 4.659, the CFAR loss of OSGO is 5.357, and an improvement of nearly 1 dB by QBWGO is obtained. In the special case of M/sub 1/=M/sub 2/=0, N/sub 1/=N/sub 2/=0, QBWGO reduces to GO, and in the case of M/sub 1/=N/sub 1/=0, QBWGO reduces to MX-CMLD.
机译:为了提高OSGO或GOSGO的性能,提出了一种基于准最佳加权(QBW)阶次统计CFAR方法的CFAR算法。分析结果表明,无论在同质背景下还是在多个目标情况下,QBWGO的性能均明显优于OSGO或GOSGO。如果干扰目标的数量为4,则QBWGO的CFAR损失为4.659,OSGO的CFAR损失为5.357,并且QBWGO改善了近1 dB。在M / sub 1 / = M / sub 2 / = 0,N / sub 1 / = N / sub 2 / = 0的特殊情况下,QBWGO降低为GO,在M / sub 1 / = N的情况下/ sub 1 / = 0,QBWGO减少为MX-CMLD。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号