In the application of Compressive Sensing (CS) theory for sidelobe suppression in Random Frequency and Pulse Repetition Interval Agile (RFPA) radar, the off−grid issues affect the performance of target parameter estimation in RFPA radar. Therefore, to address this issue, this paper presents an off−grid CS algorithm named Refinement and Generalized Double Pareto (GDP) distribution based on Sparse Bayesian Learning (RGDP−SBL) for RFPA radar that utilizes a coarse−to−fine grid refinement approach, allowing precise and cost−effective signal recovery while mitigating the impact of off−grid issues on target parameter estimation. To obtain a high-precision signal recovery, especially in scenarios involving closely spaced targets, the RGDP−SBL algorithm makes use of a three−level hierarchical prior model. Furthermore, the RGDP−SBL algorithm efficiently utilizes diagonal elements during the coarse search and exploits the convexity of the grid energy curve during the fine search, therefore significantly reducing computational complexity. Simulation results demonstrate that the RGDP−SBL algorithm significantly improves signal recovery performance while maintaining low computational complexity in multiple scenarios for RFPA radar.
Off-grid issues and high computational complexity are two major challenges faced by sparse Bayesian learning (SBL)-based compressive sensing (CS) algorithms used for random frequency pulse interval agile (RFPA) radar. Therefore, this paper proposes an off-grid CS algorithm for RFPA radar based on Root-SBL to address these issues. To effectively cope with off-grid issues, this paper derives a root-solving formula inspired by the Root-SBL algorithm for velocity parameters applicable to RFPA radar, thus enabling the proposed algorithm to directly solve the velocity parameters of targets during the fine search stage. Meanwhile, to ensure computational feasibility, the proposed algorithm utilizes a simple single-level hierarchical prior distribution model and employs the derived root-solving formula to avoid the refinement of velocity grids. Moreover, during the fine search stage, the proposed algorithm combines the fixed-point strategy with the Expectation-Maximization algorithm to update the hyperparameters, further reducing computational complexity. In terms of implementation, the proposed algorithm updates hyperparameters based on the single-level prior distribution to approximate values for the range and velocity parameters during the coarse search stage. Subsequently, in the fine search stage, the proposed algorithm performs a grid search only in the range dimension and uses the derived root-solving formula to directly solve for the target velocity parameters. Simulation results demonstrate that the proposed algorithm maintains low computational complexity while exhibiting stable performance for parameter estimation in various multi-target off-grid scenarios.
High-resolution radar systems encounter a challenge where dispersed backscatter energy from targets results in a non-uniform power distribution across range cells. Although autoregressive (AR) modeling of heterogeneous clutter can enhance the probability of range-spread target detection, the performance of detectors significantly decreases in the case of a small number of pulses due to the discard of samples equivalent to the AR order. Therefore, to mitigate performance degradation, this paper presents improved AR model-based detectors for range-spread targets in heterogeneous clutter environments, derived under the assumption of known clutter covariance matrix based on the Rao test, Wald test and generalized likelihood ratio test. Furthermore, the covariance matrix is reconstructed using estimated AR parameters through the relationship between the AR process and triangular matrix decomposition. Additionally, the asymptotic expressions for the probability of detection and false alarm show the new detectors are asymptotically constant false alarm rate with respect to the clutter covariance matrix. Experiments are conducted on both simulated and real clutter data to validate the performance of the newly derived AR model-based detectors. Both sets of results demonstrate that the enhanced detectors maintain robust performance even with a limited number of pulses, outperforming the conventional AR model-based detectors in such scenarios.
17 February 2026 in IEEE Signal Processing Letters
Compressive sensing (CS)-based sparse Bayesian learning (SBL) algorithms for random frequency and pulse repetition interval agile (RFPA) radar exhibit poor robustness under low signal-to-noise ratio (SNR) conditions. To address this issue, this letter proposes a waveform-design-enhanced SBL (WDE-SBL) method. This method integrates waveform design into the SBL framework, which employs low-complexity complex Gaussian priors, without increasing the computational load. Specifically, for the first time, this letter derives the analytical expression of the grid energy associated with the SBL algorithm for RFPA radar, clearly revealing the contributions of individual components. Based on an in-depth analysis of this expression, the proposed WDE-SBL method constructs the objective function to suppress noise floor and designs the frequency-hopping sequence accordingly. Simulation results demonstrate that by incorporating waveform design, the proposed WDE-SBL can clearly identify targets and accurately estimate target parameters under low SNR conditions where other CS-based algorithms fail.