| Paper: | SPTM-P2.8 | ||
| Session: | Detection | ||
| Time: | Tuesday, May 16, 14:00 - 16:00 | ||
| Presentation: | Poster | ||
| Topic: | Signal Processing Theory and Methods: Detection, Estimation, Classification Theory and Applications | ||
| Title: | UPPER AND LOWER BOUNDS FOR THE THRESHOLD OF THE FFT FILTER BANK-BASED SUMMATION CFAR DETECTOR | ||
| Authors: | Sichun Wang, François Patenaude, Communications Research Centre Canada, Canada; Robert Inkol, Defence Research and Development Canada, Canada | ||
| Abstract: | The reliable computation of detection threshold T given a desired probability of false alarm Pfa 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. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012