By Topic

Biparametric clutter-map CFAR processor independent of original clutter distribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yan Lin ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Jun Tang ; Xiutan Wang ; Huadong Meng

The traditional CFAR processors are based on the sliding-window concept, which have substantial performance degradation under nonhomogeneity. Owing to temporal processing and the exploitation of the local homogeneity of the map cell, the clutter-map procedure acquires enhanced robustness with little CFAR losses. In this paper, a Gaussian biparametric clutter-map constant false alarm rate (GBCM-CFAR) processor is proposed which merges the clutter-map technique and noncoherent integration together. It can approximately achieve CFAR independent of the original clutter distribution. The performance in the presence of fast point targets is assessed, in the examples of Weibull and lognormal clutter, in order to elicit the effect of the system parameters. Its performance is close to that of the optimum Neyman-Pearson detector with little CFAR losses in homogeneous environments. It is also suitable to deal with the nonhomogeneous situation.

Published in:

Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International Conference on  (Volume:6 )

Date of Conference:

6-10 April 2003