Full Text:   <63>

CLC number: 

On-line Access: 2024-05-23

Received: 2023-12-22

Revision Accepted: 2024-04-07

Crosschecked: 0000-00-00

Cited: 0

Clicked: 90

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
Open peer comments

Journal of Zhejiang University SCIENCE C 1998 Vol.-1 No.-1 P.

http://doi.org/10.1631/FITEE.2300859


A lightweight clutter suppression algorithm for passive bistatic radar


Author(s):  Yong WU, Luo ZUO, Dongliang PENG, Zhikun CHEN

Affiliation(s):  Zhejiang Institute of Communications, Hangzhou 311112, China; more

Corresponding email(s):   wuyong@zjvtit.edu.cn, zuoluo@xidian.edu.cn, dlpeng@hdu.edu.cn, czk@hdu.edu.cn

Key Words:  Passive bistatic radar, Clutter suppression, Extensive cancellation algorithm, Computational complexity, Space complexity


Yong WU, Luo ZUO, Dongliang PENG, Zhikun CHEN. A lightweight clutter suppression algorithm for passive bistatic radar[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .

@article{title="A lightweight clutter suppression algorithm for passive bistatic radar",
author="Yong WU, Luo ZUO, Dongliang PENG, Zhikun CHEN",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2300859"
}

%0 Journal Article
%T A lightweight clutter suppression algorithm for passive bistatic radar
%A Yong WU
%A Luo ZUO
%A Dongliang PENG
%A Zhikun CHEN
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2300859

TY - JOUR
T1 - A lightweight clutter suppression algorithm for passive bistatic radar
A1 - Yong WU
A1 - Luo ZUO
A1 - Dongliang PENG
A1 - Zhikun CHEN
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2300859


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 ECA while reducing the computational and space complexity 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 and cross-correlation matrices. 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 computationally 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 the ECA and its batched version, 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.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE