Upper and Lower Bounds for the Threshold of the FFT Filter Bank-Based Summation CFAR Detector

The reliable computation of detection threshold T given a desired probability of false alarm Pfa a is an important issue in the design of the FFT filter bank-based summation CFAR (constant false alarm rate) detector. The computation of detection threshold T is based on numerical procedures such as the Newton-Ralphson algorithm and a priori knowledge of lower and upper bounds for T for a given Pfa. Current approaches used in the initialization stage of the computation of threshold T are largely ad hoc as there are no theoretical upper and lower bounds for T reported in the literature. In this article, several theoretical upper and lower bounds for T for overlapped and non-overlapped signal data are derived. These results enable a proper design of the FFT filter bank-based summation CFAR detector

[1]  B. H. Maranda.  On the false alarm probability for an overlapped FFT processor , 1996 .

[2]  R. Inkol,et al.  A comparative study of FFT-summation and polyphase-FFT CFAR detectors , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).

[3]  Sichun Wang,et al.  Theoretical Performance of the FFT Filter Bank-Based Summation Detector , 2005 .

[4]  Sichun Wang,et al.  Derivation of a formula for the probability of false alarm for the FFT filter bank-based J-out-of-L CFAR detector , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[5]  R. Inkol,et al.  FFT filter bank based majority and summation CFAR detectors: a comparative study , 2004, Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513).