Next Article in Journal
Applying Graph Centrality Metrics in Visual Analytics of Scientific Standard Datasets
Previous Article in Journal
Existence Results for Second Order Nonconvex Sweeping Processes in q-Uniformly Convex and 2-Uniformly Smooth Separable Banach Spaces
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle

Parallel Computing Based Dynamic Programming Algorithm of Track-before-Detect

1
Institute of Aeronautical Radio Electronics of China, Shanghai 201100, China
2
College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(1), 29; https://doi.org/10.3390/sym11010029
Received: 19 November 2018 / Revised: 6 December 2018 / Accepted: 11 December 2018 / Published: 31 December 2018
  |  
PDF [732 KB, uploaded 28 January 2019]
  |  

Abstract

The conventional dynamic programming-based track-before-detect (DP-TBD) methods are usually intractable in multi-target scenarios. The adjacent targets may interfere with each other, and the computational complexity is increased with the number of targets. In this paper, a DP-TBD method using parallel computing (PC-DP-TBD) is proposed to solve the above problems. The search region of the proposed PC-DP-TBD is divided into several parts according to the possible target movement direction. The energy integration is carried out independently and parallel in each part. This contributes to reducing the computational complexity in each part, since the divided search region is smaller than the whole one. In addition, the target energy can only be integrated adequately in the part in which the search direction matches the target movement. This is beneficial to improve the ability to detect the targets with various movement directions in different parts with different search directions. The solution to the problem of the adjacent targets interfering with each other is discussed. The procedure of the parallel computing in the proposed PC-DP-TBD is presented in detail. Simulations are conducted to verify the superiority of the proposed PC-DP-TBD in terms of detection probability and computational complexity. View Full-Text
Keywords: parallel computing; track-before-detect; dynamic programming; weak target; computational complexity parallel computing; track-before-detect; dynamic programming; weak target; computational complexity
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Guo, Q.; Li, Z.; Song, W.; Fu, W. Parallel Computing Based Dynamic Programming Algorithm of Track-before-Detect. Symmetry 2019, 11, 29.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top