Search

Sub-array-level digital arrays effectively diminish the computational complexity and sample demand of space-time adaptive processing (STAP), thus finding extensive applications in many airborne platforms. Nonetheless, airborne sub-array-level digital array radar still encounters pronounced performance deterioration in highly heterogeneous clutter environments due to inadequate training samples. To address this issue, a clutter-sensing-driven STAP approach for airborne sub-array-level digital arrays is proposed in this paper. Firstly, we derive a signal model of sub-array-level clutter sensing in detail and then further analyze the influence of the sidelobe characteristics of the conventional sub-array joint beam on clutter sensing. Secondly, a sub-array joint beam optimization model is proposed, which optimizes the sub-array joint beam into a wide beam with flat-top characteristics to improve the clutter-sensing performance in the beam sidelobe region. Finally, we decompose the complex optimization problem into two subproblems and then relax them into the low sidelobe-shaped beam pattern synthesisproblem and second-order cone programming problem, which can be effectively solved. The effectiveness of the proposed approach is validated in a real clutter environment through numerical experiments. [ABSTRACT FROM AUTHOR]

Abstract Applying the sparse recovery (SR) technique to airborne radar space‐time adaptive processing (STAP) can greatly reduce the number of required training samples, which is advantageous in detecting targets in non‐homogeneous and non‐stationary clutter environments. However, the poor performance, the slow convergence speed or the high computational complexity of the traditional SR STAP algorithms limit their practical application. To tackle this problem, a novel efficient SR STAP algorithm is proposed. The newly proposed SR STAP algorithm utilises the log‐sum penalty to approximate the ℓ0−norm penalty, which exhibits improved convergence performance and clutter suppression performance compared to the traditional SR STAP algorithms. Besides, the proposed algorithm can ensure the convergence in each iteration by offering a closed‐form analytic solution. Furthermore, the result of the mathematical derivation demonstrates the essential equivalence between our method and the iterative reweighted ℓ2 method. By utilising this equivalence, two additional methods are proposed that incorporate the knowledge of the clutter Capon spectrum and the clutter spectrum of the iterative adaptive approach (IAA) as the components of weighted values, resulting in further performance improvement of the proposed algorithm. Finally, simulation results with both simulated data and Mountain‐Top data demonstrate the high effectiveness and performance of the proposed methods.

Applying the sparse recovery (SR) technique to airborne radar space‐time adaptive processing (STAP) can greatly reduce the number of required training samples, which is advantageous in detecting targets in non‐homogeneous and non‐stationary clutter environments. However, the poor performance, the slow convergence speed or the high computational complexity of the traditional SR STAP algorithms limit their practical application. To tackle this problem, a novel efficient SR STAP algorithm is proposed. The newly proposed SR STAP algorithm utilises the log‐sum penalty to approximate the ℓ0−norm ${\ell }_{0}-\text{norm}$ penalty, which exhibits improved convergence performance and clutter suppression performance compared to the traditional SR STAP algorithms. Besides, the proposed algorithm can ensure the convergence in each iteration by offering a closed‐form analytic solution. Furthermore, the result of the mathematical derivation demonstrates the essential equivalence between our method and the iterative reweighted ℓ2 ${\ell }_{2}$ method. By utilising this equivalence, two additional methods are proposed that incorporate the knowledge of the clutter Capon spectrum and the clutter spectrum of the iterative adaptive approach (IAA) as the components of weighted values, resulting in further performance improvement of the proposed algorithm. Finally, simulation results with both simulated data and Mountain‐Top data demonstrate the high effectiveness and performance of the proposed methods. [ABSTRACT FROM AUTHOR]

The extensive deployment of wind farms has significantly impacted the detection capabilities of space–air bistatic radar (SABR) systems. Although space–time adaptive processing techniques are available, their performance is significantly degraded, and even unable to suppress clutter. This paper explores the geometric configuration of the SABR system and the selection of detection areas, establishing a space–time clutter model that addresses the effects of wind turbine clutter (WTC). Expressions for spatial and Doppler frequencies have been derived to deeply analyze the characteristics of clutter spreading. Building on this, the paper extends two-dimensional space–time data to three-dimensional azimuth–elevation–Doppler data. It proposes a three-dimensional space–time multi-beam (STMB) strategy incorporating the Ordering Points to Identify the Clustering Structure (OPTICS) clustering algorithm to suppress WTC effectively. This algorithm selects WTC samples and applies OPTICS clustering to the clutter-suppressed data to achieve this effect. Simulation experiments further verify the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

The traditional sparse recovery (SR) space-time adaptive processing (STAP) algorithms are greatly affected by grid mismatch, leading to poor performance in airborne bistatic radar clutter suppression. In order to address this issue, this paper proposes an SR STAP algorithm for airborne bistatic radars based on atomic selection under the Bayesian framework. This method adopts the idea of atomic selection for the process of Bayesian inference, continuously evaluating the contribution of atoms to the likelihood function to add or remove atoms, and then using the selected atoms to estimate the clutter support subspace and perform sparse recovery in the clutter support subspace. Due to the inherent sparsity of clutter signals, performing sparse recovery in the clutter support subspace avoids using a massive number of atoms from an overcomplete space-time dictionary, thereby greatly improving computational efficiency. In airborne bistatic radar scenarios where significant grid mismatch exists, this method can mitigate the performance degradation caused by grid mismatch by encrypting grid points. Since the sparse recovery is performed in the clutter support subspace, encrypting grid points does not lead to excessive computational burden. Additionally, this method integrates out the noise term under a new hierarchical Bayesian model, preventing the adverse effects caused by inaccurate noise power estimation during iterations in the traditional SR STAP algorithms, further enhancing its performance. Our simulation results demonstrate the high efficiency and superior clutter suppression performance and target detection performance of this method. [ABSTRACT FROM AUTHOR]

Space–time adaptive processing (STAP) based on sparse recovery achieves excellent clutter suppression and target detection performance, even with a limited number of available training samples. However, most of these methods face performance degradation due to grid mismatch, which impedes their application in bistatic clutter suppression. Some gridless methods, such as atomic norm minimization (ANM), can effectively address grid mismatch issues, yet they are sensitive to parameter settings and array errors. In this article, the authors propose a data and model-driven algorithm that unfolds the iterative process of atomic norm minimization into a deep network. This approach establishes a concrete and systematic link between iterative algorithms, extensively utilized in signal processing, and deep neural networks. This methodology not only addresses the challenges associated with parameter settings in traditional optimization algorithms, but also mitigates the lack of interpretability issues commonly found in deep neural networks. Moreover, due to more rational parameter settings, the proposed algorithm achieves effective clutter suppression with fewer iterations, thereby reducing computational time. Finally, extensive simulation experiments demonstrate the effectiveness of the proposed algorithm in clutter suppression for airborne bistatic radar. [ABSTRACT FROM AUTHOR]

The paper explores the potential to enhance aviation safety, particularly in militarized regions, by outfitting aircraft with Side Looking Airborne Radar (SLAR) and employing space-time adaptive processing (STAP) algorithms. The research objective revolves around implementing a model of side-looking airborne radar and the corresponding STAP algorithms. This technology enables the detection of slow-moving targets amidst strong interference, encompassing both passive (clutter) and active (jammer) elements. Slow-moving targets relative to the aircraft's speed include tanks, combat vehicles, command vehicles, artillery, and logistical assets of enemy forces. The theoretical framework of space-time adaptive processing is presented, elucidating the sequential steps of the classical Sample Matrix Inversion Space-Time Adaptive Processing (SMI STAP) algorithm. The paper underscores the significance of characteristic parameters delineating a linear STAP processor. The proposed solution facilitates the detection of enemy combat measures and enhances aviation safety. It outlines a radar model installed beneath the aircraft's fuselage and elucidates algorithms for space-time adaptive processing of radar signals. The simulations conducted within the article were executed using the MATLAB environment. The simulation results indeed suggest that the proposed solution holds promise for deployment in equipping aircraft of one's own military and those engaged in operations within conflict zones. This paper stands as one of the few contributions in the literature addressing the augmentation of aircraft safety through radar and space-time adaptive processing.

In space-time adaptive processing (STAP), the coprime sampling structure can obtain better clutter suppression capabilities at a lower hardware cost than the uniform linear sampling structure. However, in practical applications, the performance of the algorithm is often limited by the number of training samples. To solve this problem, this paper proposes a fast iterative coprime STAP algorithm based on truncated kernel norm minimization (TKNM). This method establishes a virtual clutter covariance matrix (CCM), introduces truncated kernel norm regularization technology to ensure the low rank of the CCM, and transforms the non-convex problem into a convex optimization problem. Finally, a fast iterative solution method based on the alternating direction method is presented. The effectiveness and accuracy of the proposed algorithm are verified through simulation experiments. [ABSTRACT FROM AUTHOR]

Sparse recovery space–time adaptive processing (SR-STAP) technology improves the moving target detection performance of airborne radar. However, the sparse recovery method with a fixed dictionary usually leads to an off-grid effect. This paper proposes a STAP algorithm for airborne radar based on dictionary and clutter power spectrum joint correction (DCPSJC-STAP). The algorithm first performs nonlinear regression in a non-stationary clutter environment with unknown yaw angles, and it corrects the corresponding dictionary for each snapshot by updating the clutter ridge parameters. Then, the corrected dictionary is combined with the sparse Bayesian learning algorithm to iteratively update the required hyperparameters, which are used to correct the clutter power spectrum and estimate the clutter covariance matrix. The proposed algorithm can effectively overcome the off-grid effect and improve the moving target detection performance of airborne radar in actual complex clutter environments. Simulation experiments verified the effectiveness of this algorithm in improving clutter estimation accuracy and moving target detection performance. [ABSTRACT FROM AUTHOR]

Space–time adaptive processing (STAP) is an effective technology in clutter suppression and moving target detection for airborne radar. When working in the heterogeneous environment, the number of training samples that satisfy independent and identically distributed (IID) conditions is insufficient, making it difficult to ensure the estimation accuracy of the clutter plus noise covariance matrix for traditional STAP methods. Sparse recovery–based STAP (SR–STAP) methods have received widespread attention in the past few years. The accurate estimation of the clutter plus noise covariance matrix can be achieved using only a few training samples. The iterative adaptive approach (IAA) can quickly and accurately estimate the power spectrum, but applying this method directly to the STAP method cannot produce good performance. In this paper, a fast IAA–based SR–STAP method is proposed. Based on the weighted l 1 problem, the IAA spectrum is used as a weighted term to obtain a good approximation. In order to obtain an analytical solution, we use the weighted l 2 norm to approximate the weighted l 1 norm without loss of performance. Compared with the IAA–STAP method, the proposed method is more robust to errors. Moreover, the proposed method has a fast computational speed. The effectiveness of the proposed method is demonstrated by simulations. [ABSTRACT FROM AUTHOR]

The paper explores the potential to enhance aviation safety, particularly in militarized regions, by outfitting aircraft with Side Looking Airborne Radar (SLAR) and employing space-time adaptive processing (STAP) algorithms. The research objective revolves around implementing a model of side-looking airborne radar and the corresponding STAP algorithms. This technology enables the detection of slow-moving targets amidst strong interference, encompassing both passive (clutter) and active (jammer) elements. Slow-moving targets relative to the aircraft's speed include tanks, combat vehicles, command vehicles, artillery, and logistical assets of enemy forces. The theoretical framework of space-time adaptive processing is presented, elucidating the sequential steps of the classical Sample Matrix Inversion Space-Time Adaptive Processing (SMI STAP) algorithm. The paper underscores the significance of characteristic parameters delineating a linear STAP processor. The proposed solution facilitates the detection of enemy combat measures and enhances aviation safety. It outlines a radar model installed beneath the aircraft's fuselage and elucidates algorithms for space-time adaptive processing of radar signals. The simulations conducted within the article were executed using the MATLAB environment. The simulation results indeed suggest that the proposed solution holds promise for deployment in equipping aircraft of one's own military and those engaged in operations within conflict zones. This paper stands as one of the few contributions in the literature addressing the augmentation of aircraft safety through radar and space-time adaptive processing. [ABSTRACT FROM AUTHOR]

Space-time adaptive processing (STAP) is a classic anti-interference algorithm for satellite navigation. In engineering applications, the number of time-domain taps of STAP not only determines the anti-jamming performance, but also determines the FPGA logic resource required for engineering implementation. In order to reduce application costs, it is urgent to predict the minimum number of time-domain taps required to achieve specified anti-interference indicators, so as to select the lowest cost FPGA chip. Unlike traditional dimensionality reduction algorithms such as Multistage Wiener Filter (MSWF), this paper proposes a method for determining the minimum number of time-domain taps without digital sampling data. To provide such a method, this paper construct an optimization problem and a solution method that determines the minimum number of time-domain taps based on the amplitude-frequency and phase-frequency characteristics of the specific receiver channels. Moreover, this method use interference to noise ratio (INR) to estimated minimum number of time-domain taps, which ensure the minimum number meet anti-interference performance. Finally, this paper verifies the effectiveness of the method through simulation by collecting amplitude-frequency and phase-frequency characteristics of 30 sets channels, and engineering test with three 2-element space time anti-jamming receivers.

Sub-array-level digital arrays effectively diminish the computational complexity and sample demand of space-time adaptive processing (STAP), thus finding extensive applications in many airborne platforms. Nonetheless, airborne sub-array-level digital array radar still encounters pronounced performance deterioration in highly heterogeneous clutter environments due to inadequate training samples. To address this issue, a clutter-sensing-driven STAP approach for airborne sub-array-level digital arrays is proposed in this paper. Firstly, we derive a signal model of sub-array-level clutter sensing in detail and then further analyze the influence of the sidelobe characteristics of the conventional sub-array joint beam on clutter sensing. Secondly, a sub-array joint beam optimization model is proposed, which optimizes the sub-array joint beam into a wide beam with flat-top characteristics to improve the clutter-sensing performance in the beam sidelobe region. Finally, we decompose the complex optimization problem into two subproblems and then relax them into the low sidelobe-shaped beam pattern synthesisproblem and second-order cone programming problem, which can be effectively solved. The effectiveness of the proposed approach is validated in a real clutter environment through numerical experiments.

A sparse dictionary reconstruction algorithm based on grid selection is introduced to solve the grid mismatch when using the sparse recovery space time adaptive processing (SR-STAP) algorithm. First, the atom most closely related to clutter is selected from the traditional dictionary through the spectral value dimensionality reduction method. The local mesh is divided around the selected atoms to create mesh cells, and the mesh cells that are most likely to appear in the real clutter points are judged according to the local selection iteration criteria. In this way, the mesh spacing is refined, the local mesh selection is carried out step by step, and the optimal atoms in the local region are constantly adjusted and selected to narrow the search region until the iteration termination condition is met. Finally, the space-time plane is divided using a novel meshing technique that centers around the optimal atom. By removing atoms beyond the maximum range of spatial and Doppler frequencies, the simplified sparse dictionary can overcome the mesh mismatch problem. The simulation results demonstrate that the algorithm enhances the sparse recovery accuracy of clutter space-time spectrum, mitigates the mesh mismatch effect, and boosts STAP performance. [ABSTRACT FROM AUTHOR]

The space–time adaptive processing (STAP) technique can effectively suppress the ground clutter faced by the airborne radar during its downward-looking operation and thus can significantly improve the detection performance of moving targets. However, the optimal STAP requires a large number of independent identically distributed (i.i.d) samples to accurately estimate the clutter plus noise covariance matrix (CNCM), which limits its application in practice. In this paper, we fully consider the heterogeneity of clutter in real-world environments and propose a sparse Bayesian learning-based reduced-dimension STAP method that achieves suboptimal clutter suppression performance using only a single sample. First, the sparse Bayesian learning (SBL) algorithm is used to estimate the CNCM using a single training sample. Second, a novel angular Doppler channel selection algorithm is proposed with the criterion of maximizing the output signal-to-clutter-noise ratio (SCNR). Finally, the reduced-dimension STAP filter is constructed using the selected channels. Simulation results show that the proposed algorithm can achieve suboptimal clutter suppression performance in extremely heterogeneous clutter environments where only one training sample can be used. [ABSTRACT FROM AUTHOR]

Space–time adaptive processing (STAP) based on sparse recovery achieves excellent clutter suppression and target detection performance, even with a limited number of available training samples. However, most of these methods face performance degradation due to grid mismatch, which impedes their application in bistatic clutter suppression. Some gridless methods, such as atomic norm minimization (ANM), can effectively address grid mismatch issues, yet they are sensitive to parameter settings and array errors. In this article, the authors propose a data and model-driven algorithm that unfolds the iterative process of atomic norm minimization into a deep network. This approach establishes a concrete and systematic link between iterative algorithms, extensively utilized in signal processing, and deep neural networks. This methodology not only addresses the challenges associated with parameter settings in traditional optimization algorithms, but also mitigates the lack of interpretability issues commonly found in deep neural networks. Moreover, due to more rational parameter settings, the proposed algorithm achieves effective clutter suppression with fewer iterations, thereby reducing computational time. Finally, extensive simulation experiments demonstrate the effectiveness of the proposed algorithm in clutter suppression for airborne bistatic radar.

The traditional sparse recovery (SR) space-time adaptive processing (STAP) algorithms are greatly affected by grid mismatch, leading to poor performance in airborne bistatic radar clutter suppression. In order to address this issue, this paper proposes an SR STAP algorithm for airborne bistatic radars based on atomic selection under the Bayesian framework. This method adopts the idea of atomic selection for the process of Bayesian inference, continuously evaluating the contribution of atoms to the likelihood function to add or remove atoms, and then using the selected atoms to estimate the clutter support subspace and perform sparse recovery in the clutter support subspace. Due to the inherent sparsity of clutter signals, performing sparse recovery in the clutter support subspace avoids using a massive number of atoms from an overcomplete space-time dictionary, thereby greatly improving computational efficiency. In airborne bistatic radar scenarios where significant grid mismatch exists, this method can mitigate the performance degradation caused by grid mismatch by encrypting grid points. Since the sparse recovery is performed in the clutter support subspace, encrypting grid points does not lead to excessive computational burden. Additionally, this method integrates out the noise term under a new hierarchical Bayesian model, preventing the adverse effects caused by inaccurate noise power estimation during iterations in the traditional SR STAP algorithms, further enhancing its performance. Our simulation results demonstrate the high efficiency and superior clutter suppression performance and target detection performance of this method.

The extensive deployment of wind farms has significantly impacted the detection capabilities of space–air bistatic radar (SABR) systems. Although space–time adaptive processing techniques are available, their performance is significantly degraded, and even unable to suppress clutter. This paper explores the geometric configuration of the SABR system and the selection of detection areas, establishing a space–time clutter model that addresses the effects of wind turbine clutter (WTC). Expressions for spatial and Doppler frequencies have been derived to deeply analyze the characteristics of clutter spreading. Building on this, the paper extends two-dimensional space–time data to three-dimensional azimuth–elevation–Doppler data. It proposes a three-dimensional space–time multi-beam (STMB) strategy incorporating the Ordering Points to Identify the Clustering Structure (OPTICS) clustering algorithm to suppress WTC effectively. This algorithm selects WTC samples and applies OPTICS clustering to the clutter-suppressed data to achieve this effect. Simulation experiments further verify the effectiveness of the algorithm.

Abstract Small‐array high‐frequency surface wave radar (HFSWR) is widely used to monitor maritime targets as it can be used to save on‐land resources. In small‐array HFSWR systems, the main lobe of the receiving angle spectrum is significantly broadened. In complex clutter backgrounds, an extremely wide beam severely influences clutter suppression performance; consequently, targets with a low signal‐to‐clutter ratio (SCR) may be eliminated, or the angle may be barely estimated. This study proposes a space‐time adaptive processing (STAP) algorithm based on hyper beamforming (HBF) to improve the clutter suppression performance of small‐array HFSWR. In addition, HBF can obtain more independent identical distributed training samples than the conventional beamforming; thus, the STAP algorithm can extract the clutter information with high accuracy in the covariance matrix estimation. Moreover, this study combines an efficient STAP algorithm with a joint domain localised (JDL) algorithm to improve clutter suppression. Based on the experimental results, the proposed HBF‐JDL algorithm performs satisfactorily and significantly improves the SCR. Moreover, HBF‐JDL is still applicable at lower SCRs of the target compared with JDL.

In space-time adaptive processing (STAP), the coprime sampling structure can obtain better clutter suppression capabilities at a lower hardware cost than the uniform linear sampling structure. However, in practical applications, the performance of the algorithm is often limited by the number of training samples. To solve this problem, this paper proposes a fast iterative coprime STAP algorithm based on truncated kernel norm minimization (TKNM). This method establishes a virtual clutter covariance matrix (CCM), introduces truncated kernel norm regularization technology to ensure the low rank of the CCM, and transforms the non-convex problem into a convex optimization problem. Finally, a fast iterative solution method based on the alternating direction method is presented. The effectiveness and accuracy of the proposed algorithm are verified through simulation experiments.

Space–time adaptive processing (STAP) is an effective technology in clutter suppression and moving target detection for airborne radar. When working in the heterogeneous environment, the number of training samples that satisfy independent and identically distributed (IID) conditions is insufficient, making it difficult to ensure the estimation accuracy of the clutter plus noise covariance matrix for traditional STAP methods. Sparse recovery–based STAP (SR–STAP) methods have received widespread attention in the past few years. The accurate estimation of the clutter plus noise covariance matrix can be achieved using only a few training samples. The iterative adaptive approach (IAA) can quickly and accurately estimate the power spectrum, but applying this method directly to the STAP method cannot produce good performance. In this paper, a fast IAA–based SR–STAP method is proposed. Based on the weighted l1 problem, the IAA spectrum is used as a weighted term to obtain a good approximation. In order to obtain an analytical solution, we use the weighted l2 norm to approximate the weighted l1 norm without loss of performance. Compared with the IAA–STAP method, the proposed method is more robust to errors. Moreover, the proposed method has a fast computational speed. The effectiveness of the proposed method is demonstrated by simulations.

Space-time adaptive processing (STAP) approaches based on sparse Bayesian learning (SBL) have attracted much attention for the benefit of reducing the training samples requirement and accurately recovering sparse signals. However, it has the problem of a heavy computational burden and slow convergence speed. To improve the convergence speed, the variational Bayesian inference (VBI) is introduced to STAP in this paper. Moreover, to improve computing efficiency, a fast iterative algorithm is derived. By constructing a new atoms selection rule, the dimension of the matrix inverse problem can be substantially reduced. Experiments conducted on the simulated data and measured data verify that the proposed algorithm has excellent clutter suppression and target detection performance. [ABSTRACT FROM AUTHOR]

Non‐sidelooking airborne radar encounters significant non‐stationary and heterogeneous clutter environments, resulting in a severe shortage of samples. Sparse recovery‐based space‐time adaptive processing (SR‐STAP) methods can achieve good clutter suppression performance with limited samples. Nonetheless, grid‐based SR‐STAP algorithms encounter off‐grid effects in non‐sidelooking arrays, which can severely degrade the clutter suppression performance. In this study, the authors propose a novel gridless SR‐STAP method in the continuous spatial‐temporal domain to address the issue of off‐grid effects. Inspired by the fact that sparse Bayesian learning (SBL) framework implicitly performs a structured covariance matrix estimation, the authors reparameterise its cost function to directly estimate the block‐Toeplitz structured matrix from the measurements in a gridless manner. Since the proposed cost function is non‐convex, we utilise a majorisation‐minimisation‐based iterative procedure to estimate the clutter covariance matrix. Finally, using the standard concept of semidefinite programming, the authors derive a convex gridless implementation of the SBL cost function for uniformly sampled radar systems. Extensive simulation experiments demonstrate the exceptional clutter suppression and target detection performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Wind turbine clutter (WTC) contamination affects polarimetric meteorological observations and automatic high-impact weather detection algorithms in several ways, such as, misidentification of precipitation echoes, false mesocyclone detections, and incorrect storm cell identification. With the dramatic growth of the wind power industry, this would only aggravate in the future. Since fully digital Phased Array Radar (PAR) is a promising candidate technology for the next generation of weather radars, evolutionary signal processing algorithms that make use of their capabilities should be investigated to mitigate WTC contamination. This article investigates the use of Space-Time Adaptive Processing (STAP) to mitigate WTC contamination with ground-based polarimetric PAR. First, a flexible wind turbine time-series signal simulator is developed to characterize the contamination signatures in the space-time domain. Then, a STAP algorithm that removes the contamination is presented and demonstrated on simulated data. Two digital radar back-end architectures are considered to evaluate the performance of the proposed algorithm. One with digital sub-array outputs the other one with fully digital outputs (i.e., element-level digital). Results indicate the WTC spectrum has a characteristic structure in the space-time domain, and that biases induced in polarimetric weather variables can be more effectively mitigated using an fully digital PAR.

Space-time adaptive processing (STAP) is an important method of clutter suppression that requires adequate training samples. For an airborne conformal array radar, conventional STAP methods do not have enough training samples to acquire good performance due to the range dependent clutter caused by geometry and the problem of polarization. Sparse-recovery-based STAP (SR-STAP) methods have garnered significant attention in the past few decades because they only require a small number of training samples. Sparse Bayesian Learning (SBL) methods have seen increasing amounts of development due to its robust, self-regularizing nature and because it is not sensitive to user parameters, but it converges slowly. In this paper, a novel fast SBL (NFSBL) method is put forward to increase the rate of convergence. To minimize the SBL penalty function, the proposed method introduces the conjugate function to construct a surrogate function. Additional solution sparsity will be achieved through iteratively minimizing the surrogate function. Then, from the proposed method, we could obtain a more accurate clutter plus noise covariance matrix. Numerical simulation results express that this method could acquire better performance of STAP and improvement in convergence and computational complexity for a conformal array. [ABSTRACT FROM AUTHOR]

The measurement errors induced by the space‐time adaptive processing (STAP) is gaining attention for its significant detriment to the precision of the global navigation satellite system (GNSS) receiver positioning. To mitigate measurement errors, the steering vector (SV) estimation method based on spreading is widely employed in measurement error mitigation algorithms. However, the hazard of the SV estimation fluctuation problem is ignored in these algorithms. In this paper, the specific harm of such SV estimation fluctuation problem is analysed. To alleviate such problem and to eliminate the measurement errors as much as possible, a robust STAP beamformer for GNSS receivers is proposed. First, to acquire a series of robust SVs in different integration times, a desired signal covariance (DSC) matrix is iteratively reconstructed to remove the disturbance from thermal noise and the residual jamming signals. Second, to eliminate measurement errors, a replacement matrix is formed to help guarantee the phase linearities of the tapped delay lines (TDLs). Numerical examples demonstrate that the method can achieve a set of stable SV estimations and linear phase TDLs, leading to a carrier‐to‐noise‐power ratio (C/N0$C/N_0$) of more than 50 dBHz and a code phase bias of less than 3.4 m, which outperform the methods used for comparison. [ABSTRACT FROM AUTHOR]

In this article, a new statistical method for estimating the clutter covariance matrix in space–time adaptive radar signal processing (STAP) is presented and studied. The new method was designed for multiple-input–multiple-output (MIMO) radar with time division multiplexing (TDM). An extensive analysis of statistical and non-statistical methods for estimating the clutter covariance matrix in STAP is presented in this paper. In addition, the STAP algorithm for the standard statistical SMI clutter covariance matrix estimation method, which is based on QR distribution, has been presented. The new method is based on LU distribution with partial pivoting. Simulation results confirm the validity of the presented model and theoretical assumptions. In addition, more accurate object detection results were demonstrated for specific computational examples than for other statistical methods. Considering the current analysis of the literature, it is noted that attention has now been focused worldwide on the study of non-statistical methods for estimating clutter covariance matrices in heterogeneous environments. Hence, it should be emphasized that the posted study fills a gap in current research on STAP. [ABSTRACT FROM AUTHOR]

Small‐array high‐frequency surface wave radar (HFSWR) is widely used to monitor maritime targets as it can be used to save on‐land resources. In small‐array HFSWR systems, the main lobe of the receiving angle spectrum is significantly broadened. In complex clutter backgrounds, an extremely wide beam severely influences clutter suppression performance; consequently, targets with a low signal‐to‐clutter ratio (SCR) may be eliminated, or the angle may be barely estimated. This study proposes a space‐time adaptive processing (STAP) algorithm based on hyper beamforming (HBF) to improve the clutter suppression performance of small‐array HFSWR. In addition, HBF can obtain more independent identical distributed training samples than the conventional beamforming; thus, the STAP algorithm can extract the clutter information with high accuracy in the covariance matrix estimation. Moreover, this study combines an efficient STAP algorithm with a joint domain localised (JDL) algorithm to improve clutter suppression. Based on the experimental results, the proposed HBF‐JDL algorithm performs satisfactorily and significantly improves the SCR. Moreover, HBF‐JDL is still applicable at lower SCRs of the target compared with JDL. [ABSTRACT FROM AUTHOR]

The space–time adaptive processing (STAP) technique can effectively suppress the ground clutter faced by the airborne radar during its downward-looking operation and thus can significantly improve the detection performance of moving targets. However, the optimal STAP requires a large number of independent identically distributed (i.i.d) samples to accurately estimate the clutter plus noise covariance matrix (CNCM), which limits its application in practice. In this paper, we fully consider the heterogeneity of clutter in real-world environments and propose a sparse Bayesian learning-based reduced-dimension STAP method that achieves suboptimal clutter suppression performance using only a single sample. First, the sparse Bayesian learning (SBL) algorithm is used to estimate the CNCM using a single training sample. Second, a novel angular Doppler channel selection algorithm is proposed with the criterion of maximizing the output signal-to-clutter-noise ratio (SCNR). Finally, the reduced-dimension STAP filter is constructed using the selected channels. Simulation results show that the proposed algorithm can achieve suboptimal clutter suppression performance in extremely heterogeneous clutter environments where only one training sample can be used.

The article presents the description, assumptions and subsequent steps of the space-time adaptive processing (STAP) algorithms used as a signal processing tool in radars. The possibilities of object detection using the Sample Matrix Inversion (SMI) and Data Domain Least Squares (DDLS) algorithms were compared and showned. The article shows the impact of the use of parallel programming on the computation time of both algorithms. The main aim of this study was to propose an efficient method for the real-time implementation of the STAP algorithm in airborne radar systems. The idea of using parallel programming in STAP, supported only by the preliminary research results presented above, gives a real chance for the casual implementation of the STAP algorithm in a radar operating in close to real time mode.

This paper proposes a cooperated range ambiguous clutter suppression method for moving target detection in the background of range-ambiguous clutter with a phased array (PA)–frequency diverse array (FDA) dual-mode radar. With the FDA mode, the range-ambiguous clutters are discriminated in the transmit spatial frequency domain, and thus the clutter covariance matrixes (CCMs) corresponding to unambiguous and ambiguous regions can be independently estimated. Therefore, the enhanced CCM can be reconstructed by using a linear combination of these distinguished CCMs from different range regions. With the PA mode, the enhanced CCM is applied, thus taking advantages of its high beampattern gain as well as alleviating the range ambiguous clutter suppression problem. Simulation results are presented to verify the effectiveness of the proposed method in range-ambiguous clutter scenarios. [ABSTRACT FROM AUTHOR]

In order to deal with the problem space-time adaptive processing (STAP) performance degradation of an airborne phased array system caused by the serious shortage of independent and identical distributed (IID) training samples in the nonhomogeneous clutter environment, an improved direct data domain method based on sparse Bayesian learning is proposed in this paper, which only uses a single snapshot data of a cell under test (CUT) to suppress the clutter and has fast computational speed. Firstly, three hyper-parameters required to obtain the sparse solution are derived. Secondly, the comparative analysis of their iterative formulas is made, and the piecewise iteration of hyper-parameter that has an obvious influence on the computational complexity of obtaining sparse solution is presented. Lastly, with the approximate prior information of the target, the clutter sparse solution is given and its covariance matrix is effectively estimated to calculate the adaptive filter weight and realize the clutter suppression. Simulation results verify that the proposal can dramatically decrease the computational burden while keeping the superior heterogeneous clutter suppression performance. [ABSTRACT FROM AUTHOR]

In this paper, a low-altitude wind speed estimation method based on the fuselage frustum conformal array system is proposed. Firstly, based on the signal model of the fuselage conformal array radar, the four-dimensional joint phase compensation of the echo data in the Doppler domain and three-dimensional space-frequency domain is performed by using the four-dimensional frequency domain compensation method. Secondly, the clutter covariance matrix is estimated by the compensated echo data, and a space-time Adaptive Processing (STAP) processor suitable for low-altitude windshear target is constructed to suppress clutter. Finally, the maximum Doppler value of each distance cell is extracted, and the wind velocity is estimated. Simulation results show that the proposed method can effectively suppress clutter and accurately estimate wind speed. [ABSTRACT FROM AUTHOR]

In recent years, sparse recovery-based space-time adaptive processing (SR-STAP) technique has exhibited excellent performance with insufficient samples. Sparse Bayesian learning algorithms have received considerable attention for their remarkable and reliable performance. Its implementation in large-scale radar systems is however hindered by the overwhelming computational load and slow convergence speed. This paper aims to address these drawbacks by proposing an improved iterative reweighted sparse Bayesian learning algorithm based on expansion-compression variance-components (ExCoV-IIR-MSBL). Firstly, a modified Bayesian probabilistic model for SR-STAP is introduced. Exploiting the intrinsic sparsity prior of the clutter, we divide the space-time coefficients into two parts: the significant part with nontrivial coefficients and the irrelevant part with small or zero coefficients. Meanwhile, we only assign independent hyperparameters to the coefficients in the significant part, while the remaining coefficients share a common hyperparameter. Then the generalized maximum likelihood (GML) criterion is adopted to classify the coefficients, ensuring both accuracy and efficiency. Hence, the parameter space in Bayesian inference will be significantly reduced, and the computational efficiency can be considerably promoted. Both theoretical analysis and numerical experiments validate that the proposed algorithm achieves superior performance with considerably improved computational efficiency in sample shortage scenarios. [ABSTRACT FROM AUTHOR]

Abstract Space‐time adaptive processing (STAP) methods can provide good clutter suppression potential in airborne radar systems. However, the performance of these methods is limited by the training samples' support in practical applications. To address this issue, a deep learning framework for STAP is developed. First, the clutter space‐time data and their exact clutter covariance matrices (CCMs) are simultaneously modelled via simulation, in which various non‐ideal factors such as aircraft crabbing, array errors, and internal clutter motion with all possible levels in practice are all considered. Then, a multi‐layer two‐dimensional convolutional neural network (CNN) is developed. In this CNN, low‐resolution angle‐Doppler profiles estimated by a few training samples are used for the input and the high‐resolution counterpart obtained by the exact CCMs are utilized for the labels. Once trained, the CNN can be used to predict the high‐resolution angle‐Doppler profile using a few measured data in near real time. The high‐resolution clutter spectrum can be further calculated using the space‐time steering dictionary and the above obtained profile. Finally, the CCM of the measured data can be constructed and the space‐time weight vector can also be achieved. Compared with recently developed sparsity‐based STAP methods, the performance of the proposed method is better and the computational load of it is far fewer, and therefore more suitable for real‐world implementation. The simulation results have demonstrated the superiority of the proposed method in both clutter suppression performance and computation efficiency.

Abstract A new reduced‐rank (RR) space‐time adaptive processing (STAP) algorithm based on multistage selections of angle‐Doppler filters is proposed in the form of a generalised sidelobe canceller. First, two types of the RR auxiliary angle‐Doppler filters are designed based on the discrete Fourier basis functions. Then, a novel multistage method is implemented to select the angle‐Doppler filters by using the cross‐correlation observed at the current stage and the residual output observed at the previous stage. Finally, the asymptotic statistic performance of target detection is evaluated in terms of the conventional framework of STAP for the cases of both known and unknown covariance, which shows that the proposed algorithm is capable of providing the constant false alarm rate. Numerical examples are provided, and they demonstrate that the proposed algorithm is able to offer better performance than the existing sparsity‐based and the conventional reduced‐dimension algorithms under the intrinsic clutter motion and array gain and phase errors.

In this study, using FM radio signals for transmitters of opportunity, detection of moving targets by passive radar on moving platforms is investigated. Ground reflectivity is modelled as discrete patch approximation with uniform distribution in phase and Rayleigh distribution in amplitude. The target echo is modelled as Doppler shifted and delayed form of the transmit signal based on the target’s angular position, range, and velocity. The clutter echoes, received by surveillance antennas, are also modelled by the superposition of Doppler shifted and delayed form of the transmit signal. Displaced Phase Center Array (DPCA) method is used for clutter rejection and moving target detection. Both matched filter and reciprocal filter are used in the pulse compression stage. The performance of the proposed method is evaluated by using an improvement factor (IF). DPCA with reciprocal filter outperforms DPCA with matched filter with the improvement value of 5,1 dB due to the reciprocal filter producing time-invariant impulse responses.

Different from the phased-array with the same carrier frequency for all elements providing only angle-dependent beampattern, frequency diverse array (FDA) using a small frequency offset across its array elements offers new application capabilities due to its both angle and range dependent beampattern, which allows auto beam-scanning capability even without the employment of phase shifters, which are required in phased-array. This paper studied FDA auto-scanning beam characteristics and several potential radar applications. The FDA auto-scanning beam characteristics including range and angle coupling, beam auto-scanning rate and integral array again are analyzed. To fully utilize FDA specific auto-scanning beam characteristics, several potential applications such as radio frequency (RF) stealth or RF localization deception, range-ambiguous clutter suppression and mainlobe interference suppression are discussed. Moreover, several discussions about space-time adaptive processing and possible future investigations are provided. This paper is formulated from a top-level system description, which aims to introduce this promising FDA technique to radar community so that more investigations can be facilitated.

Different from ground-based or airborne early warning radar, space-based radar (SBR) possesses large coverage capability. As a result, several discrete strong scatter points from the antenna side-lobe shares the same feature with the real targets in range-Doppler domain, which leads to false alarms when conducting constant false alarm rate (CFAR) detection process, and the detection performance with regard to SBR deteriorates seriously. In this paper, a discrete side-lobe clutter recognition method based on sliding filter response loss is proposed for space-based radar. Firstly, considering both the echo inhomogeneity and the limited degrees of freedom (DOFs) after dimension-reduced space-time adaptive processing (STAP), the sliding window design strategy is employed to segment range cells for the observation scene. Then, the images related to different range segments are registered after clutter suppression, in this way, the candidate target parameters, including the position information and the amplitude information are counted. On this basis, the reliable recognition scheme between the real target and the discrete side-lobe clutter can be realized by comparing these filter response losses. Compared with recent works, experimental results based on real measured data show that the proposed method significantly improves the fault-tolerant discrimination ability, which possesses high robustness in algorithm performance as well as good prospect in engineering application.

Abstract This letter proposes a direction of arrival (DOA) and time of delay (TOA) joint estimation algorithm with deep transfer learning. Recently deep learning technique has been applied to solve the joint estimation problem by using the pretrained network and perform well. But in real applications, different scenarios require to cost much time to obtain different pretrained network. In order to overcome these problems, a transfer scheme for DOA and TOA joint estimation is proposed based on a multi‐task network, which uses a shared‐private structure to enhance the transferability of the pretrained network in different signal‐to‐noise ratio (SNR) scenarios. Thus, for different target scenarios, the proposed transferring scheme just uses a few of data from new scenario to fine‐tune pretrained network, which can effectively reduce the computation complexity with satisfied estimation accuracy. Simulation results show that the proposed algorithm is superior to other traditional methods in estimation accuracy and efficiency under different SNR testing scenarios.

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. [ABSTRACT FROM AUTHOR]

Airborne distributed coherent aperture radar is of great significance for expanding the detection capability of the system. However, the extra observation dimension introduced by its sparse configuration also deteriorates the performance of traditional adaptive processing in a non-uniform environment. This paper focuses on moving target detection when the system works in a clutter–jamming-coexisting environment. In order to make full use of the specific low-rank structure to reduce the requirement for training data, this paper proposes a two-stage adaptive scheme that cancels jamming and clutter separately. The proposed suppression scheme first excludes the mainlobe jamming component from the training data based on the prior clutter subspace projection and performs intra-node clutter suppression. Then, the remaining jamming is jointly canceled based on the covariance obtained with its inter-pulse mixture model. Numerical examples show that this scheme can effectively reduce the blocking effect of main lobe jamming on high-speed targets but, due to the inaccuracy of the prior subspace, there is a certain additional loss of signal-to-noise ratio for near stationary targets. The simulation also shows that the proposed scheme is equally applicable to systems with a time-varying distributed geometry. [ABSTRACT FROM AUTHOR]

In order to study the space-time characteristics of sea clutter, the sea clutter is always measured by the airborne multichannel radar; however, the sea clutter shows the heterogeneity between range gates, which means the space-time covariance matrix's correspondence to the single range gate cannot be estimated accurately. Meanwhile, the measurement of the sea clutter data by the airborne radar is usually affected by the motion of the platform, which makes the analysis results unrepresentative of the space-time characteristics of the pure sea clutter. In this paper, a sea clutter measurement method based on L-band shore-based multichannel radar is proposed, where the transmit sub-array periodically moves with the pulse repetition period to obtain multiple sets of coherent processing interval pulses for each range gate. This measurement method can exclude the influences of the moving platform. Moreover, a sea clutter space-time signal model of the single range gate is proposed, and the model is used to simulate three-dimensional sea clutter data with space-time coupling characteristics. With verification of the measured and simulated data, it can be seen that the data composed of single range gate and multiple coherent processing interval pulses can accurately estimate the space-time covariance matrix corresponding to this single range gate. Furthermore, the space-time characteristics are analyzed based on the measured data. The results show that the eigenvalue spectrum and the spread width of space-time power spectrum are influenced by the backscattering coefficient of sea clutter and the speed of sea surface motion. In comparison, the decorrelation effect caused by the backscattering coefficient of sea clutter is stronger than that caused by the speed of the surface motion. The proposed method is helpful for guiding multichannel sea clutter measurement and the analysis results are of great significance to the clutter suppression algorithms of the marine multichannel radar. [ABSTRACT FROM AUTHOR]

Abstract Traditional space‐time adaptive processing (STAP) suffers from severe performance degradation in dense false target jamming scenarios, especially mainlobe deceptive jamming. To solve this problem, the superimposed stepped frequency (SSF) radar is explored and its ability in suppressing the mainlobe deceptive jamming is studied in this work. SSF radar can provide a controllable degree of freedom in range domain besides the traditional freedom in angle and Doppler domains, which can be used to distinguish true and false targets. Thus, the range cascaded STAP approach is proposed to suppress the deceptive jamming and the clutter. First, the true target and clutter are blocked in carrier frequency domain. Then, the jamming is attenuated by the adaptive filter in carrier frequency domain with the jamming covariance matrix being constructed by the blocked data. At last, the clutter can be suppressed by the cascaded STAP in the space‐time domain. Simulation results demonstrate the effectiveness of the proposed radar framework and the processing approach in suppressing the clutter and jamming.

Abstract In heterogeneous environments, the snapshot under test (SUT) and the corresponding training samples are usually not independent and identically distributed, which seriously degrades the clutter suppression performance of space‐time adaptive processing (STAP). To solve this problem, this paper proposes a method which can select the training samples with similar clutter characteristics to that of the SUT. The proposed method constructs a novel united generalised inner product (UGIP) statistic with the sub‐aperture clutter covariance matrix (CCM) of the SUT and that of any other snapshot. The smaller the statistic is, the more similar the corresponding two snapshots are. Therefore, the snapshots with smaller UGIPs will be selected as training samples. The proposed method effectively improves the quality of the selected training samples for STAP and a better estimate of the CCM can be obtained. Simulation experiments verify the effectiveness of the proposed method with both simulated data and measured data.

Space-time adaptive processing (STAP) approaches based on sparse Bayesian learning (SBL) have attracted much attention for the benefit of reducing the training samples requirement and accurately recovering sparse signals. However, it has the problem of a heavy computational burden and slow convergence speed. To improve the convergence speed, the variational Bayesian inference (VBI) is introduced to STAP in this paper. Moreover, to improve computing efficiency, a fast iterative algorithm is derived. By constructing a new atoms selection rule, the dimension of the matrix inverse problem can be substantially reduced. Experiments conducted on the simulated data and measured data verify that the proposed algorithm has excellent clutter suppression and target detection performance.

Space-time adaptive processing (STAP) is a well-known technique for slow-moving target detection in the clutter spreading environment. For an airborne conformal array radar, conventional STAP methods are unable to provide good performance in suppressing clutter because of the geometry-induced range-dependent clutter, non-uniform spatial steering vector, and polarization sensitivity. In this paper, a knowledge aided STAP method based on sparse learning via iterative minimization (SLIM) combined with Laplace distribution is proposed to improve the STAP performance for a conformal array. The proposed method can avoid selecting the user parameter. the proposed method constructs a dictionary matrix that is composed of the space-time steering vector by using the prior knowledge of the range cell under test (CUT) distributed in clutter ridge. Then, the estimated sparse parameters and noise power can be used to calculate a relatively accurate clutter plus noise covariance matrix (CNCM). This method could achieve superior performance of clutter suppression for a conformal array. Simulation results demonstrate the effectiveness of this method. [ABSTRACT FROM AUTHOR]

Detecting a moving target is an attractive topic in many fields, such as remote sensing. Space-time adaptive processing (STAP) plays a key role in detecting moving targets in strong clutter backgrounds for airborne early warning radar systems. However, STAP suffers serious clutter suppression performance loss when the number of training samples is insufficient due to the inhomogeneous clutter environment. In this article, an efficient sparse recovery STAP algorithm is proposed. First, inspired by the relationship between multiple sparse Bayesian learning (M-SBL) and subspace-based hybrid greedy algorithms, a new optimization objective function based on a subspace penalty is established. Second, the closed-form solution of each minimization step is obtained through the alternating minimization algorithm, which can guarantee the convergence of the algorithm. Finally, a restart strategy is used to adaptively update the support, which reduces the computational complexity. Simulation results show that the proposed algorithm has excellent performance in clutter suppression, convergence speed and running time with insufficient training samples. [ABSTRACT FROM AUTHOR]

When the transmitter is in motion, the airborne passive bistatic radar (PBR) has a complex clutter geometry and lacks independent and identically distributed training samples in clutter estimation and suppression. In order to solve these problems, this paper proposes a space–time adaptive processing (STAP) algorithm based on root off-grid sparse Bayesian learning. The proposed algorithm first models the space–time base of the dictionary as an adjustable state. Then, the positions of those dynamic bases are optimized by iterating a maximum expectation algorithm. In this way, the off-grid error in clutter estimation can be eliminated even when the modeling grid is wide. To further improve the accuracy of clutter estimation, the proposed algorithm eliminates the error caused by samples with singular values in the root off-grid sparse Bayes learning by artificially adding pseudorandom noise and using hypothesis testing. The simulation results show that the proposed algorithm achieves better performance than the existing algorithms. [ABSTRACT FROM AUTHOR]

Space-time adaptive processing (STAP) is a fundamental topic in airborne radar applications due to its clutter suppression ability. Reduced-dimension (RD)-STAP can release the requirement of the number of training samples and reduce the computational load from traditional STAP, which attracts much attention. However, under the situation that training samples are severely deficient, RD-STAP will become poor like the traditional STAP. To enhance RD-STAP performance in such cases, this paper develops a novel RD-STAP algorithm using random matrix theory (RMT), RMT-RD-STAP. By minimizing the output clutter-plus-noise power, the estimate of the inversion of clutter plus noise covariance matrix (CNCM) can be obtained through optimally manipulating its eigenvalues, thus producing the optimal STAP weight vector. Specifically, the clutter-related eigenvalues are estimated according to the clutter-related sample eigenvalues via RMT, and the noise-related eigenvalue is optimally selected from the noise-related sample eigenvalues. It is found that RMT-RD-STAP significantly outperforms the RD-STAP algorithm when the RMB rule cannot be satisfied. Theoretical analyses and numerical results demonstrate the effectiveness and the performance advantages of the proposed RMT-RD-STAP algorithm. [ABSTRACT FROM AUTHOR]