Search Results (4)

The spaceborne-airborne bistatic radar (SABR) system employs a spaceborne transmitter and an airborne receiver, offering significant advantages, such as wide coverage, outstanding anti-stealth capabilities, and notable resistance to jamming. However, SABR operates in a downward-looking configuration, and due to the separation of the transmitter and receiver, non-side-looking array reception, and the effects of Earth’s rotation, clutter exhibits both spatial-temporal coupling and distance dependence. These factors cause substantial expansion in spatial and temporal frequency domains, leading to severe degradation in radar detection performance for moving targets. This paper establishes an SABR clutter signal model that applies to arbitrary geometric configurations to respond to these challenges. The paper uses this model to analyze the non-side-looking clutter characteristics in a geostationary spaceborne-airborne bistatic radar configuration. Furthermore, the paper investigates the impact of various observation areas and geometric configurations on detection performance, using SCNR loss as the performance index. Finally, this paper gives suggestions on the transceiver’s geometric configuration and the observation area selection. Full article

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. Full article

Aimingat non-side-looking airborne radar, we propose a novel unsupervised affinity propagation (AP) clustering radar detection algorithm to suppress clutter and detect targets. The proposed method first uses selected power points as well as space-time adaptive processing (STAP) weight vector, and designs matrix-transformation-based weighted input data, with which the first unsupervised weighted AP clustering is proposed by means of their similarity matrix, responsibility values and availability values. Then, new reconstructed weighted power inputs are designed, and the second weighted AP clustering is proposed. Finally, with their cluster results, a detection-discriminant criterion is designed for the judgment of target detection, and simultaneously, the clutter is suppressed. Compared with the conventional and important STAP, ADC and JDL algorithms, and several SO-based, GO-based and OS-based CFAR algorithms, the proposed unsupervised algorithm achieves much higher probability of detection and provides distinctly superior target-detection performance. With reasonable computation time, it can better conquer the range dependence in characteristic of clutter and better process non-independent identically distributed (non-IID) samples of non-side-looking radar. Sufficient simulations are performed, and they demonstrate that the proposed unsupervised algorithm is preferable and advantageous. Full article

Clutter suppression is a key problem for airborne radar, and space-time adaptive processing (STAP) is a core technology for clutter suppression and moving target detection. However, in practical applications, the non-uniform time-varying environments including clutter range dependence for non-side-looking radar lead to the training samples being unable to satisfy the sample requirements of STAP that they should be independent identical distributed (IID) and that their number should be greater than twice the system’s degree of freedom (DOF). The lack of sufficient IID training samples causes difficulty in the convergence of STAP and further results in a serious degeneration of performance. To overcome this problem, this paper proposes a novel autoencoder neural network for clutter suppression with a unique matrix designed to be decoded and encoded. The main challenges are improving the accuracy of the estimation of the clutter-plus-noise covariance matrix (CNCM) for STAP convergence, designing the form of the data input to the network, and making the network successfully explored to the improvement of CNCM. For these challenges, the main proposed solutions include designing a unique matrix with a certain dimension and a series of covariance data selections and matrix transformations. Consequently, the proposed method compresses and retains the characteristics of the covariances, and abandons the deviations caused by the non-uniformity and the deficiency of training samples. Specifically, the proposed method firstly develops a unique matrix whose dimension is less than half of the DOF, meanwhile, it is based on a processing of the selected clutter-plus-noise covariances. Then, an autoencoder neural network with $l_2$ regularization and the sparsity regularization is proposed for the unique matrix to be decoded and encoded. The training of the proposed autoencoder can be achieved by reducing the total loss function with the gradient descent iterations. Finally, an inverted processing for the autoencoder output is designed for the reconstruct ion of the clutter-plus-noise covariances. Simulation results are used to verify the effectiveness and advantages of the proposed method. It performs obviously superior clutter suppression for both side-looking and non-side-looking radars with strong clutter, and can deal with the insufficient and the non-uniform training samples. For these conditions, the proposed method provides the relatively narrowest and deepest IF notch. Furthermore, on average it improves the improvement factor (IF) by 10 dB more than the ADC, DW, JDL, and original STAP methods. Full article