Abstract: In passive bistatic radar, the computational efficiency of clutter suppression algorithms remains low, due to continuous increases in bandwidth for potential illuminators of opportunity and the use of multi-source detection frameworks. Accordingly, we propose a lightweight version of the extensive cancellation algorithm (ECA), which achieves clutter suppression performance comparable to that of ECA while reducing the computational and space complexities by at least one order of magnitude. This is achieved through innovative adjustments to the reference signal subspace matrix within the ECA framework, resulting in a redefined approach to the computation of the autocorrelation matrix and cross-correlation vector. This novel modification significantly simplifies the computational aspects. Furthermore, we introduce a dimension-expanding technique that streamlines clutter estimation. Overall, the proposed method replaces the computation-intensive aspects of the original ECA with fast Fourier transform (FFT) and inverse FFT operations, and eliminates the construction of the memory-intensive signal subspace. Comparing the proposed method with ECA and its batched version (ECA-B), the central advantages are more streamlined implementation and minimal storage requirements, all without compromising performance. The efficacy of this approach is demonstrated through both simulations and field experimental results.

Key words: Passive bistatic radar; Clutter suppression; Extensive cancellation algorithm; Computational complexity; Space complexity

Please provide your name, email address and a comment

Your Name: Affili: E-Mail Address:

Comment (Please comment in English):


Verification Code(click to change a pic):