CT-CFAR Algorithm for Radar Detection

• CT-CFAR is a constant false alarm rate detector that employs truncated noise estimation and CLEAN-based sidelobe suppression for reliable radar target detection.
• It dynamically adjusts local thresholds by leveraging learnable historical sidelobe information, reducing false alarms in cluttered environments.
• The algorithm demonstrates high precision with P_d > 0.9 at -15 dB SNR, outperforming standard CFAR techniques in simulations and real-world applications.

The CT-CFAR (CLEAN and Truncated statistic CFAR) algorithm is a constant false alarm rate detector designed to achieve robust target detection in radar systems where reference window samples are contaminated by sidelobe responses and other non-homogeneous interferences. Integrating truncated statistics for noise estimation and the CLEAN concept for iterative sidelobe suppression, CT-CFAR restores the homogeneity assumption—essential for reliable threshold setting—and enhances adaptability in complex and dense environments. Additionally, learnable historical sidelobe information is incorporated to dynamically adjust local detection thresholds, minimizing false alarms in sidelobe-prone regions. The algorithm demonstrates high-precision detection without requiring prior knowledge of abnormal samples, outperforming standard CFAR techniques in both simulation and real-world conditions (Zhu et al., 23 Nov 2025).

1. Radar Echo Model and Statistical Basis

The CT-CFAR algorithm operates on radar echo signals acquired in multi-channel FMCW (frequency modulated continuous wave) configurations. The transmitted chirp is modeled as

$$S_T(t) = A_T e^{j\bigl(2\pi f_c t + \pi K t^2\bigr)}, \quad t \in [0, T_c]$$

where $A_T$ is the transmit amplitude, $f_c$ is carrier start frequency, $K=B/T_c$ denotes chirp slope (with bandwidth $B$ and chirp duration $T_c$). The received IF signal post down-conversion and filtering contains both beat frequency and Doppler shift components:

$$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$

where $f_b$ derives from range, $f_D$ from velocity, and $n(t) \sim \mathcal{CN}(0,\sigma_n^2)$ is complex Gaussian noise.

For $A_T$0 antennas, after digitization and windowing, the signal for channel $A_T$1 is

$A_T$2

where $A_T$3 and $A_T$4 are sample and pulse repetition intervals. A 2D FFT (range-Doppler) followed by noncoherent accumulation (NCA) yields the power spectrum:

$A_T$5

For medium-to-high SNR, the cross-term vanishes and $A_T$6 follows a $A_T$7 distribution with $A_T$8.

2. Truncated Statistic for Noise Estimation

Background noise mean estimation is performed by truncating outlier-contaminated samples in the reference window. The noise is modeled as $A_T$9, with PDF and CDF:

$f_c$0

$f_c$1

where $f_c$2 is the lower incomplete gamma function.

By truncating at threshold $f_c$3, only samples $f_c$4 are retained. The conditional mean is:

$f_c$5

Letting observed samples $f_c$6 (with $f_c$7), their mean $f_c$8 approximates $f_c$9. The truncation level $K=B/T_c$0 is iteratively set to achieve internal false alarm rate $K=B/T_c$1 by solving $K=B/T_c$2. This iterative process yields the background mean $K=B/T_c$3, forming the noise matrix $K=B/T_c$4. Subtraction restores the homogeneity assumption:

$K=B/T_c$5

3. CLEAN-Based Sidelobe Suppression and Target Reconstruction

The CLEAN concept is adapted to iteratively remove detected target and sidelobe energy. Upon identifying a cell-under-test (CUT) $K=B/T_c$6, the algorithm reconstructs both main lobe and sidelobe response using the Candan estimator for sub-bin localization,

$K=B/T_c$7

and least-squares (LS) matching to steer the multichannel template. For each target,

• A template vector $K=B/T_c$8 is formed (vectorized from the steering matrix around $K=B/T_c$9),
• Observed patches from all $B$0 channels form $B$1,
• Channel gains $B$2 are estimated by LS,

$B$3

The reconstructed spectrum $B$4 (target plus sidelobes) is subtracted from $B$5 and accumulated into the sidelobe-history matrix $B$6. This process iterates until no spectrum peaks remain over threshold.

4. Adaptive Thresholding and CFAR Decision Rule

Detection is performed on the homogeneity-restored matrix. For each CUT,

• Reference window mean is computed:

$B$7

excluding $B$8 guard cells.

• The adaptive threshold is set:

$B$9

where $T_c$0 is the scale parameter defined to achieve global $T_c$1, computed or tabulated by inverting the Gamma CDF.

Detection occurs if

$T_c$2

This approach accounts for both current noise and historical sidelobe contamination ($T_c$3), reducing susceptibility to repeated false alarms.

5. Learnable Historical Sidelobe Information

CT-CFAR maintains a sidelobe-history matrix $T_c$4, initialized to zero. After each CLEAN subtraction,

$T_c$5

where $T_c$6 excludes the main lobe. As detections accumulate, $T_c$7 encodes regions of historical sidelobe presence, raising local thresholds and adaptively suppressing persistent sidelobe-induced false alarms. This mechanism is effective in dense scenarios with multiple closely-spaced targets.

6. Algorithm Workflow and Computational Characteristics

Pseudocode for CT-CFAR is structured as follows:

1. Compute per-channel 2D FFT and noncoherent sum $T_c$8.
2. Estimate noise mean via truncated statistic iteration.
3. Build and subtract noise floor $T_c$9.
4. Initialize $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$0 to zeros.
5. Repeat:
   • Locate peak CUT.
   • Compute threshold using local $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$1.
   • If CUT exceeds threshold:
     • Refine localization via Candan.
     • LS reconstruct target+sidelobe power spectrum $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$2.
     • Record detection; CLEAN-subtract $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$3.
     • Update $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$4 with $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$5.
   • Else break.
6. Output target list.

The algorithm exhibits computational efficiency comparable to mean-based CFARs. Closed-form ML noise estimation and efficient LS filtering yield real-time operation (MATLAB implementation detection completed in $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$60.03 s for standard map size).

7. Performance Assessment

Monte Carlo simulations with 100 trials and 20 targets per trial (varying Doppler content) were conducted, benchmarking CT-CFAR against CA-CFAR, GO/SO-CFAR, OS-CFAR, TM-CFAR, TS-CFAR, and SS-CFAR. At $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$7, CT-CFAR attains $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$8 down to SNR $$S_{IF}(t) = A_{IF} \exp\bigl\{ j[2\pi f_b t + 2\pi f_D t + \phi_0] \bigr\} + n(t)$$9 –15 dB, maintaining $f_b$0 stability across SNR regimes. Receiver operating characteristic (ROC) analysis reveals CT-CFAR achieves the highest area under curve.

Field measurements using the TI AWR2243 cascaded radar ($f_b$1 virtual MIMO channels) demonstrated precise target delineation and minimal clutter; background noise modeled by CT-CFAR passes Gaussianity tests (Shapiro–Wilk) and Q–Q fitting. In practical range–Doppler projection, CT-CFAR most clearly isolates human targets, even under heavy clutter.

A plausible implication is that historical sidelobe learning, truncated noise estimation, and CLEAN subtraction can be extended to further adaptive CFAR developments, potentially facilitating robust operation in more severely non-homogeneous and interference-dominated scenarios.

(Zhu et al., 23 Nov 2025)