| With the rapid development of integrated circuit and digital technology,the traditional radar system based on customized hardware board shows many disadvantages,such as high cost of software and hardware,unable to upgrade,low flexibility and low development efficiency.In this trend,traditional radar is developing towards the direction of software radar with high flexibility,modularity,scalability and high performance.The allocation of traditional radar tasks requires manual operation.This allocation method not only required designers to have extensive radar knowledge and experience in task assignment,but also had low assignment efficiency and could not meet the current design standards of software radar.Therefore,this dissertation delves into the task allocation of software radar.This dissertation analyzes the design criteria of "software radar".Under the condition of limited hardware resources,the traditional allocation methods has some problems,such as difficult task scheduling,uneven resource allocation,low allocation efficiency,limited operator experience and so on.This dissertation proposes a design scheme to solve the automatic deployment mapping of radar tasks by using quadratic assignment problem(QAP).The scheme realizes the modularization of process tasks by encapsulating radar process data parameters.Under the constraint of system specific throughput time,the scheme generates the logical relationship mapping table between task module and multiprocessor core,and realizes the automatic deployment of task module.In view of the problem that the number of task modules is larger than the number of processor cores.The task module partition algorithm of radar flow graph is compiled in this dissertation.The algorithm first finds out the critical path of the task flow graph,and then divides and encapsulates it without loops.The processed task flow graph not only arranges the task modules into task sets with the same number of processor cores,but also realizes the "1-to-1" relationship mapping.Since there is no cyclic connection between task sets,the additional scheduling overhead caused by partitioning is avoided.As the increase of the number of tasks in the radar flow graph,the number of allocation strategies increases exponentially,resulting in the collapse of QAP algorithm when allocating task sets.In this scheme,Ant Colony Optimization(ACO)assisted QAP allocation is used to solve this problem.And the scheme optimizes the ant colony algorithm,combines the improved ant colony algorithm with QAP.and write the task allocation algorithm code.The task assignment algorithm can search the mapping strategy with the shortest communication time and minimum system delay by using the difference of the communication bandwidth parameters.The simulation results show that the radar task allocation scheme can effectively divide the radar task flow diagram,and realize the "many to few" automatic deployment between the task module and the processor core.Through the comparative analysis of multiple groups of experimental results.The use of partition algorithm and the improvement of ant colony algorithm not only reduce the use of hardware board,but also reduce the system delay time by nearly 7%.Finally,by comparing with the manual debugging,the allocation scheme in this dissertation can search for high-quality distribution strategy in a short time. |