Fast Algorithm of Passive Bistatic Radar Detection for Weak Targets

In the passive bistatic radar (PBR) system, there exists methods used to address the issue of detecting weak targets without being influenced by non-ideal factors from adjacent strong targets. These methods utilize the sparsity in the delayDoppler domain of the cross ambiguity function (CAF) to detect weak targets. However, the modeling and solving of this method involve substantial memory consumption and computational complexity. To address these challenges, this paper establishes a target detection model for PBR based on batch processing of sparse representation and recovery. This model results in a reduction of the computational complexity and memory resource requirements for sparse representation and recovery, and provides favorable conditions for parallel execution of the algorithm. Experimental results using digital video broadcasting-terrestrial (DVB-T) signal indicate that the proposed approach enables fast and stable detection of weak targets.