Synthesis of Sparse Linear Arrays via Low-Rank Hankel Matrix Completion

TL;DR

This paper introduces a novel method for synthesizing sparse non-uniform antenna arrays by employing low-rank Hankel matrix completion, enhancing array flexibility and reducing element count.

Contribution

It proposes an improved nonuniform array synthesis algorithm using low-rank Hankel matrix completion with log-det heuristic, expanding array design options.

Findings

Effective reduction in array elements achieved.

Increased degrees of freedom in array pattern design.

Successful synthesis of non-uniform arrays with relaxed constraints.

Abstract

In the process of realizing the synthesis of the antenna array synthesis, it is of practical significance to arrange the nonuniform array and reduce the number of elements. According to the Matrix Pencil Method (MPM), we proposed an improved nonuniform array algorithm for reducing the number of array elements. We design the Hankel matrix by low-rank completion via log-det heuristic, and impose relatively loose constraints on the pattern, which may increase the degree of freedom of the radar array, so as to achieve the purpose of antenna array synthesis and non-uniform array.