At present, there are many technical methods in the field of target detection, but the detection methods are greatly affected by direct-path signals and need technical support such as extracting pure direct-path signals, so they cannot be used under the condition of without-direct-path signals. In this paper, a distributed target detection method is studied under a without-direct-path signals system. In the case of without-direct-path signals, target detection is achieved by the generalized likelihood ratio test (GLRT). At the same time, the input echo signals in target detection need time synchronization, so the impact of time delay should be eliminated. However, the traditional time delay estimation method is realized through coherent processing between echoes, which requires a high signal-to-noise ratio (SNR). Therefore, a time delay estimation method is proposed in this paper. Finally, the experimental results show that the accuracy of target detection by GLRT is improved, and the signal-to-noise ratio is also improved under the condition of without-direct-path signals. Moreover, the accuracy of delay detection is improved.

Sparse recovery is one of the most important methods for single snapshot DOA estimation. Due to fact that the original l0-minimization problem is a NP-hard problem, we design a new alternative fraction function to solve DOA estimation problem. First, we discuss the theoretical guarantee about the new alternative model for solving DOA estimation problem. The equivalence between the alternative model and the original model is proved. Second, we present the optimal property about this new model and a fixed point algorithm with convergence conclusion are given. Finally, some simulation experiments are provided to demonstrate the effectiveness of the new algorithm compared with the classic sparse recovery method.

In the passive bistatic radar (PBR) system, methods exist 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 delay-Doppler 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 partitions the CAF into blocks, identifies blocks requiring processing based on the presence of targets, and improves the construction and utilization of the measurement matrix. This results in a reduction in the computational complexity and memory resource requirements for sparse representation and recovery, and provides favorable conditions for parallel execution of the algorithm. Experimental results indicate that the proposed approach increases the number of blocks by a factor of four, and reduces the number of real multiplications by approximately an order of magnitude. Hence, compared with the traditional approach, the proposed approach enables fast and stable detection of weak targets.