The design and optimization of sensor array configurations is a significant challenge for distributed SAR-GMTI radar systems because the system performance of distributed array radar is a comprehensive result of several conflicting evaluation indicators. This paper developed a multi-objective intelligent optimization method to solve the global optimal problem of array configurations in terms of achieving optimal GMTI performance. Firstly, to formulate the relationship between array configuration and GMTI performance, we established three objective functions derived from evaluating indicators of SAR-GMTI performance. Specifically, in the objective functions, we proposed a novel clutter covariance matrix model that added several typical non-ideal factors of the real-world detection environment. This provides a way to build a bridge between the array configuration, environment clutter, and GMTI performance. Then, we proposed an improved multi-objective snake optimization algorithm (IMOSOA) that combined the Pareto optimization mechanism with snake optimization to solve the multi-objective optimization problem while reconciling the conflicts between different objective functions. Meanwhile, some significant improvements were made to speed up convergence. That is, tent chaotic mapping-based initialization, multi-group coevolution, and individual mutation strategies were applied to solve the non-convergence problem of global searching. Finally, in the case of an airborne SAR-GMTI system, numerical experiments demonstrated that the proposed IMOSOA has superior performance than other contrast methods, especially in terms of GMTI applications.
Bistatic radar exhibits spatial isomerism and diverse configurations, leading to unique clutter characteristics distinct from those of monostatic radar. The clutter rank serves as a pivotal indicator of clutter characteristics, enabling the quantification of clutter severity. Space-time adaptive processing (STAP) is a critical technique to detect moving targets, and clutter rank determines the number of independent and identically distributed (IID) training samples and the degree of freedom (DOF) for effective suppression of clutter that STAP requires. Therefore, the accurate estimation of clutter rank for bistatic radar can provide a crucial indicator for designing and constructing STAP processors, thereby facilitating fast and efficient clutter suppression in bistatic radar systems. This study is based on the idea that clutter rank is the number of prolate spheroidal wave function (PSWF) orthogonal bases utilized for approximating the clutter signal. Firstly, the challenge of utilizing PSWF orthogonal bases for approximating the clutter signal in bistatic radar is elucidated. This pertains to the fact that, unlike monostatic radar clutter, bistatic radar clutter is not capable of being expressed as a single-frequency signal. The clutter rank estimation for bistatic radar is thus derived as the frequency bandwidth estimation. Secondly, to achieve this estimation, the frequency distribution of each individual scattering unit is investigated, thereby determining their extending frequency broadening (EFB) as compared to that of single-frequency. Subsequently, the integral average of EFB across the entire range bin is computed, ultimately enabling the acquisition of bistatic radar’s frequency bandwidth. Finally, the estimation method is extended to non-side-looking mode and limited observation areas with pattern modulation. Simulation experiments confirm that our proposed method provides accurate clutter rank estimations, surpassing 99% proportions of large eigenvalues across various bistatic configurations, observation modes, and areas.