...
首页> 外文期刊>IEEE Transactions on Aerospace and Electronic Systems >Fast coherent integration for maneuvering target with high-order range migration via TRT-SKT-LVD
【24h】

Fast coherent integration for maneuvering target with high-order range migration via TRT-SKT-LVD

机译:通过TRT-SKT-LVD实现高目标范围迁移的机动目标的快速相干集成

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

摘要

This paper addresses the coherent integration problem for detecting a maneuvering target with high-order range migration (RM), where the velocity, acceleration, and jerk result in, respectively, the first-order range migration (FRM), second-order range migration (SRM), and third-order range migration (TRM) within the coherent pulse interval. A fast coherent integration method based on time reversing transform (TRT), second-order keystone transform (SKT) and Lv’s distribution (LVD), i.e., TRT-SKT-LVD, is proposed. In this method, TRT operation is first presented to remove the TRM and FRM simultaneously. After that, the SKT is employed to correct the remaining SRM and then the coherent accumulation could be obtained via LVD. The proposed algorithm is simple and fast in that it can be easily implemented by using complex multiplications, the fast Fourier transform (FFT), and inverse FFT (IFFT). Compared with the existing methods, the presented method can realize the coherent integration without any searching procedure and can achieve a good balance between the computational cost and detection ability. Both simulated and real data demonstrate the effectiveness of the proposed algorithm.
机译:本文讨论了用于检测具有高阶距离偏移(RM)的机动目标的相干积分问题,其中速度,加速度和加速度率分别导致一阶距离偏移(FRM),二阶距离偏移(SRM)和相干脉冲间隔内的三阶范围迁移(TRM)。提出了一种基于时间反转变换(TRT),二阶梯形失真校正(SKT)和Lv分布(LVD)即TRT-SKT-LVD的快速相干积分方法。在这种方法中,首先提出TRT操作以同时删除TRM和FRM。之后,使用SKT校正剩余的SRM,然后可以通过LVD获得相干累积。所提出的算法简单且快速,因为它可以通过使用复杂的乘法,快速傅里叶变换(FFT)和逆FFT(IFFT)轻松实现。与现有方法相比,该方法无需任何搜索过程即可实现相干集成,并在计算成本和检测能力之间取得良好的平衡。仿真数据和真实数据都证明了该算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号