Scholarlink

Abstract <p>The aim of this work is to study the efficiency of the constant false alarm rate algorithm CFAR. The possibility of using classical radar methods in ISAC 6G networks is being studied. The CFAR algorithm operates within a closely-localized (compared to classical radar) geographical zone (up to 35 kilometers). The configuration of a continuous-wave radar with frequency modulation operating in the millimeter-wave range of 30–300 GHz is considered, probing is performed by pulses with linear frequency modulation. A comparative analysis of two models of the CFAR algorithm (based on the average value—cell averaging and median value—ordered statistics) is provided, a conclusion about the quality and speed of their work is drawn. The problem of estimating the computational complexity of the CFAR algorithm in real-time systems is stated. A numerical experiment with modeling in the MATLAB environment is conducted, allowing us to justify ways to reduce the computational complexity of the CFAR algorithm. It is shown that the OS-CFAR algorithm is the optimal option for ISAC networks. A method for reducing the computational complexity of the OS-CFAR algorithm using an approximated solution of the factorial equation is proposed. It is shown that the speed of obtaining an approximated solution is higher than the speed of solving the factorial equation in symbolic form.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Study of the Efficiency of the CFAR Algorithm for Aerial Targets Detection in ISAC 6G Networks

  • 期刊论文

  • 发表日期：

    2025年12月1日

查看全文
  • E. P. Saulenko,
  • G. A. Fokin

摘要

Abstract

The aim of this work is to study the efficiency of the constant false alarm rate algorithm CFAR. The possibility of using classical radar methods in ISAC 6G networks is being studied. The CFAR algorithm operates within a closely-localized (compared to classical radar) geographical zone (up to 35 kilometers). The configuration of a continuous-wave radar with frequency modulation operating in the millimeter-wave range of 30–300 GHz is considered, probing is performed by pulses with linear frequency modulation. A comparative analysis of two models of the CFAR algorithm (based on the average value—cell averaging and median value—ordered statistics) is provided, a conclusion about the quality and speed of their work is drawn. The problem of estimating the computational complexity of the CFAR algorithm in real-time systems is stated. A numerical experiment with modeling in the MATLAB environment is conducted, allowing us to justify ways to reduce the computational complexity of the CFAR algorithm. It is shown that the OS-CFAR algorithm is the optimal option for ISAC networks. A method for reducing the computational complexity of the OS-CFAR algorithm using an approximated solution of the factorial equation is proposed. It is shown that the speed of obtaining an approximated solution is higher than the speed of solving the factorial equation in symbolic form.