| CPC G06F 30/13 (2020.01) [G01S 7/40 (2013.01)] | 8 Claims |

|
1. A method for constructing a redundancy-removed coprime radar array, comprising:
obtaining a first sub-array element and a second sub-array element used for constructing a redundancy-removed coprime radar array, and determining a redundancy-removed coprime array respectively corresponding to the first sub-array element and the second sub-array element by a graph theory method; and
obtaining target echo data of the redundancy-removed coprime array, and obtaining a target radar array by performing one-bit quantization on the target echo data for completing array cavities of the redundancy-removed coprime array;
wherein, before the completing, positions of all non-empty array elements in a redundancy coprime array are used to place radars, and before the completing, the radars are not arranged in positions of empty array elements;
wherein the step of determining a redundancy-removed coprime array respectively corresponding to the first sub-array element and the second sub-array element by a graph theory method further comprises:
constructing an initial coprime array based on the first sub-array element and the second sub-array element;
fixing a head array element and a tail array element of the initial coprime array;
traversing all coprime sub-arrays in the initial coprime array and calculating a poor joint array of each coprime sub-array; and
according to connectivity of an undirected graph corresponding to the poor joint array of each coprime sub-array, selecting the redundancy-removed coprime array from all the coprime sub-arrays; wherein the redundancy-removed coprime array is a smallest coprime sub-array with non-connectivity in the undirected graphs of all coprime sub-arrays.
|