Browse > Article
http://dx.doi.org/10.5515/KJKIEES.2014.25.8.849

A Study of Efficient CFAR Algorithm  

Shin, Sang-Jin (Technical Support Center for National Defense Industry of Agency for Defense Development)
Publication Information
The Journal of Korean Institute of Electromagnetic Engineering and Science / v.25, no.8, 2014 , pp. 849-856 More about this Journal
Abstract
This paper proposes a new efficient CFAR algorithm. The structure of the proposed CFAR is relatively simple as compared with the OS-CFAR or ML-CFAR which are considered to deal with the nonhomogeneous environment such as clutter and multiple targets. The proposed algorithm is effectively applied to the radar signal processor with reduced computation burden. The relationship between the threshold and PFA of the proposed CFAR is derived analytically. The CFAR loss of the proposed CFAR algorithm is compared with CA-CFAR and OS-CFAR based on both SNR and ADT(Average Detection Threshold).
Keywords
CFAR; Threshold; PFA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 N. Levanon, Radar Principles, John Wiley & Sons, 1988.
2 B. R. Mahafza, Radar Systems Analysis and Design Using Matlab, CRC Press, 2000.
3 S. Blake, "OS-CFAR theory for multiple targets and nonuniform clutter", IEEE Transactions on AES, vol. 24, no. 6, 1988.
4 R. Ravid, N. Levanon, "Maximum-likelihood CFAR for Weibul background", IEE Proceedings-F, vol. 139, no. 3, 1992.
5 R. B. Robert, "The Weibull distribution applied to the ground clutter backscatter coefficient", Technical Report, Research and Engineering Directorate, U. S. AMC, 1969.
6 P. P. Gandhi, S. A. Kassam, "Analysis of CFAR processors in nonhomogeneous background", IEEE Trans. on AES, vol. 24, no 4, 1988.
7 A. Papoulis, Probability, Random Variables, and Stochastic Process, McGraw-Hill, 1991.
8 A. Populios, Probability & Statistics, Prentice Hall, 1990.
9 G. N. Watson, Theory of Bessel Functions, Cambridge University Press, London and NewYork, 1944.
10 H. Cohen, Mathematics for Scientists & Engineers, Prentice Hall, 1992.