{'fraction_non_alphanumeric': 0.0264, 'fraction_numerical': 0.0, 'mean_word_length': 5.28643216080402, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A fast implementation of Dynamic Programming based Track-Before-Detect for radar system

This paper addresses the problem of computational efficiency with respect to Dynamic Programming (DP) based Track-Before-Detect (TBD). Generally, DP-TBD is a grid-based method that estimates target trajectory by means of searching all the physically admissible paths in a finite discrete state space. However, its computational complexity increases nonlinearly as the state space expands with size or dimension, which heavily restricts its applications for many realistic scenarios, e.g., radar target detection. To alleviate this problem, a fast two-step implementation of DP-TBD is proposed in this work. In the first step, to reduce the computational costs, target states are roughly estimated by searching a discrete grid with larger cell size. In the second step, an accurate search is performed only on the parts of the state space indicated by the results in the first step with reasonable computational cost. Additionally, the proposed algorithm is also suitable for the surveillance radar scenarios. Simulation results show that the proposed algorithm can effectively improve the computational efficiency of DP-TBD with limited performance degradation.