Costas sequence search algorithm based on multi-machine cooperation

Abstract

The invention relates to a Costas sequence search algorithm based on multi-machine cooperation. The Costas sequence search algorithm comprises the following steps: S1, inputting a task order of a Costas sequence to be searched; S2, disassembling the task to obtain subtask information, and adding the subtask information into a database and a message queue MQ; S3, analyzing the task at the client, obtaining the task through a monitoring queue in the message queue, and extracting and recovering task information from the message queue MQ through a reflection principle; S4, completing and summarizing subtasks, initialization of task functions being completed through parameters for transmitting task information recovery, starting a thread pool to execute the subtasks, the multiple subtasks being summarized in a message queue and a database, and finally the number of Costas sequences and time spent in searching being obtained. According to the method, the problems that time consumed by single-machine search of the Costas sequences is too long and performance of single-machine search of the high-order Costas sequences is not supported are solved, and the search speed is greatly increased.

Description

Technical field [0001] The present invention is a Costa sequence search method, and more particularly to a CostaS sequence search method based on a multi-machine collaboration technology. Background technique [0002] With the development of science and technology, digital signal processing technology has also become more mature. In engineering practice, the demand with good correlation has become more and more universal. Since the Costas sequence has the main flap and sharp and vice-via flaws and Low ideal "nail" fuzzy function features, for this, Costas sequences are important and widely used in information security, wireless communications, radar systems, and cryptography. Therefore, research on COSTAS sequence is of great significance. [0003] In the 1990s, Lloydr.Welch and S.W.Golomb et al. Introduced this original theory into the research of COSTAS sequences, proposed Welch structures, golomb structures, etc. and has achieved certain research results. These scholars use kn...

AI Technical Summary

Problems solved by technology

[0008] In order to solve the above problems, the present invention provides a Costas sequence search method based on multi-machine cooperation technology, which solves the problem that the single-machine search for the Costas sequence takes too long and the performance of the single-machine search for high-order Costas sequences does not support the problem

Images