A Low‐Complexity Target Detection Technique Using the Prefix Sum Algorithm

ABSTRACT A conventional target detection technique for FMCW millimeter‐wave radar applies a two‐dimensional (2D) cell‐averaging constant false alarm rate (CA‐CFAR) detector to all range‐doppler cells in order to suppress noise and clutter. However, this 2D CA‐CFAR method has significant drawbacks, particularly its high computational cost due to the large number of additions required, resulting in a time complexity of O(n 4 ). To decrease the computational complexity while ensuring the detection accuracy, a novelty CA‐CFAR technique based on the prefix sum algorithm with a complexity O(n 2 ) is proposed in this article. Simulations verify the feasibility of the proposed method. Compared to both conventional and state‐of‐the‐art optimized CA‐CFAR techniques, the proposed method reduces the number of addition operations by 95%, lowers CFAR loss by approximately 0.5 dB, and improves the figure of merit (FOM) by about 20% at a fixed false alarm rate of 10 −6 . This advanced technique offers significant computational efficiency for radar applications.

Authors

Institutions

Publication Details

Journal
Electronics Letters
Published
2025-01-01
DOI
https://doi.org/10.1049/ell2.70202
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Low‐Complexity Target Detection Technique Using the Prefix Sum Algorithm

Li Zhang, Feng Zhang, Ke Wang, Hai Lin
Electronics Letters
Chaos-based Image/Signal Encryption
article

A Low‐Complexity Target Detection Technique Using the Prefix Sum Algorithm

Li Zhang, Feng Zhang, Ke Wang, Hai Lin
article en

Abstract

ABSTRACT A conventional target detection technique for FMCW millimeter‐wave radar applies a two‐dimensional (2D) cell‐averaging constant false alarm rate (CA‐CFAR) detector to all range‐doppler cells in order to suppress noise and clutter. However, this 2D CA‐CFAR method has significant drawbacks, particularly its high computational cost due to the large number of additions required, resulting in a time complexity of O(n 4 ). To decrease the computational complexity while ensuring the detection accuracy, a novelty CA‐CFAR technique based on the prefix sum algorithm with a complexity O(n 2 ) is proposed in this article. Simulations verify the feasibility of the proposed method. Compared to both conventional and state‐of‐the‐art optimized CA‐CFAR techniques, the proposed method reduces the number of addition operations by 95%, lowers CFAR loss by approximately 0.5 dB, and improves the figure of merit (FOM) by about 20% at a fixed false alarm rate of 10 −6 . This advanced technique offers significant computational efficiency for radar applications.

Electronics LettersVol. 61(1)
Anhui University (CN), Nanjing University (CN)
Openalex Percentile: Top 96%
Chaos-based Image/Signal Encryption
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Low‐Complexity Target Detection Technique Using the Prefix Sum Algorithm — Li Zhang, Feng Zhang, et al. · Electronics Letters (2025) | TGRS Research Map | TGRS