Abstract
An online pulse interleaving scheduling algorithm is proposed for a solution to the task scheduling problem in the digital array radar (DAR). The full DAR task structure is explicitly considered in a way that the waiting duration is able to be utilized to transmit or receive subtasks, namely the pulse interleaving, as well as the receiving durations of different tasks are able to be overlapped. The algorithm decomposes the pulse interleaving scheduling analysis into the time constraint check and the energy constraint check, and schedules online all kinds of tasks that are able to be interleaved. Thereby the waiting duration and the receiving duration in the DAR task are both fully utilized. The simulation results verify the performance improvement and the high efficiency of the proposed algorithm compared with the existing ones.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
