DP-TBD algorithm based on Hungarian assignment algorithm

Shanzhu Xiao; Huamin Tao; Luping Zhang; Xinglin Shen

doi:10.1117/12.3015991

16 January 2024 DP-TBD algorithm based on Hungarian assignment algorithm

Shanzhu Xiao, Huamin Tao, Luping Zhang, Xinglin Shen

Proceedings Volume 12973, Workshop on Electronics Communication Engineering (WECE 2023); 129730D (2024) https://doi.org/10.1117/12.3015991
Event: Workshop on Electronics Communication Engineering (WECE 2023), 2023, Guilin, China

Abstract

The dynamic programming track before detect (DP-TBD) algorithm, with its high target detection performance, has garnered significant attention. However, as the processing dimension increases, the computational complexity inevitably rises. The high computing load poses challenges for the unoptimized DP-TBD algorithm to meet real-time requirements in engineering applications, considering hardware limitations. Therefore, effective reduction of the calculation load is crucial to enable the application of TBD technology in real-time systems. To address the issue of high computational complexity in the DP-TBD algorithm, this work proposes a DP-TBD algorithm based on the Hungarian assignment algorithm. The core concept of this algorithm involves filtering low-amplitude data through a low-threshold process and then using the Hungarian assignment algorithm to establish data associations between adjacent frames. By filtering out a large amount of low threshold data, the proposed DP-TBD algorithm significantly reduces computational complexity. Simulation results demonstrate that the proposed algorithm exhibits good detection performance even in low signal-to-noise ratios (SNR).

(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Shanzhu Xiao, Huamin Tao, Luping Zhang, and Xinglin Shen "DP-TBD algorithm based on Hungarian assignment algorithm", Proc. SPIE 12973, Workshop on Electronics Communication Engineering (WECE 2023), 129730D (16 January 2024); https://doi.org/10.1117/12.3015991

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available