RADAR DETECTION IN K-DISTRIBUTED CLUTTER

The paper compares two newly proposed detection schemes for targets in K-distributed clutter: the first implements a generalised likelihood ratio test, and the second represents a discrete realisation of the classical Neymann-Pearsop detector. Results indicate that the two optimisation strategies yield substantially equivalent performance, but the generalised likelihood ratio test is simpler in its structure and offers some additional advantages both at the design and at the analysis stage.