Complexity analysis of permutation test versus rank test for nonparametric radar detection

摘要

In [5] we have presented a algorithm by Permutation Test in Radar application and in [4] we compared Permutation Test (PT) and Rank Test (RT) applied to nonparameteric radar detection.Now analize the complexity with respect to number of pulses N,references samples M,detection probability P_d and false alarm probability P_fa.. We analyze the detector perfomance of the permutation test versus rank test in terms of detection probability P_d and we show same optimum values of the pulses number N,the value differences in SNR for both types of tests.