Abstract
It is first shown how the two well-known, but quite differently structured CFAR algorithms, CAGO (cell averaging greatest of) CFAR and OS (ordered statistic) CFAR, can be freely combined. The result is the CAOS (cell averaging ordered statistic) CFAR. Against this background, a new CFAR algorithm is introduced. It is called CASH (cell averaging statistic Hofele (1997)) CFAR. Compared with the thresholds of the other CFARs (CA, CAGO, OS, CAOS), the thresholds of this new CFAR algorithm is of exceptionally high quality. Moreover, the processing power required by the CASH-CFAR is significantly less than for the OS- and CAOS-CFAR.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.