Real-Time Adaptive Dwell Scheduling for Digital Array Radar Based on Virtual Dynamic Template

According to the characteristics of signal processing in digital array radar (DAR), an adaptive dwell scheduling algorithm based on the virtual dynamic template is proposed, where a general pulse interleaving method with the overlap of receiving durations is involved. The virtual dynamic template is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on aerospace and electronic systems 2022-08, Vol.58 (4), p.3197-3208
Hauptverfasser: Cheng, Ting, Li, Zhongzhu, Tan, Qianqian, Wang, Shaoxing, Yue, Chengyu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:According to the characteristics of signal processing in digital array radar (DAR), an adaptive dwell scheduling algorithm based on the virtual dynamic template is proposed, where a general pulse interleaving method with the overlap of receiving durations is involved. The virtual dynamic template is introduced to realize the general pulse interleaving among tracking tasks, where the tracking tasks with different numbers and repetition intervals of pulses may be interleaved under the time and energy constraints. The proposed dwell scheduling algorithm is a perfect combination of adaptive dwell scheduling technique and novel pulse interleaving based on the virtual dynamic template. It is developed based on the task model with multiple pulses and can realize real-time dwell scheduling, therefore, can be used in an actual radar system. Furthermore, to improve the efficiency of the proposed dwell scheduling algorithm, the efficient version of it is given. Simulation results demonstrate that the proposed algorithms can improve the scheduling performance effectively. Furthermore, the scheduling performance and efficiency can be balanced easily with the control of the utilization ratio threshold in the proposed efficient algorithm.
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2022.3145773