Abstract

The greatest of constant false alarm rate processor (GO CFAR) is a useful architecture for adaptively setting a radar detection threshold in the presence of clutter edges. The GO CFAR input is often the envelope detected in-phase (I) and quadrature (Q) channels of the baseband signal (x/sub e/=/spl radic/(I/sup 2/+Q/sup 2/)). This envelope detection can also be approximated using x=a max{|I|,|Q|}+b min{|I|,|Q|} which requires less complex hardware (a and b are simple multiplying coefficients). The envelope GO CFAR processor and several envelope approximation GO CFAR processors are compared in terms of the probability of false alarm (PFA) performance. Closed-form expressions which describe the PFA performance are given and their accuracy evaluated. It is shown that for all cases, the PFA is proportional to the number of reference cells n for small threshold multiplier T and inversely proportional to n for large T. A region of intersection occurs where the PFA is the same for two different values of n. For example, at T'=1.68 in the |I|+|Q| GO CFAR (a=1, b=1) the PFA for n=1 is equal to the optimal n=/spl infin/ fixed-threshold PFA (PFA=0.112).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.