Translator Disclaimer
24 September 1997 Complexity analysis of permutation test versus rank test for nonparametric radar detection
Author Affiliations +
In this paper, we analyze the complexity of an optimal algorithm for realizing the permutation test applied to nonparametric radar detection against the complexity of rank test realization. For a primitive permutation test algorithm, the computational work is very high and its implementation in real-time is difficult, due to the number of operations increases with the number of reference samples (M) to the power of the number of integrated pulses (N) (i.e. MN). We propose new permutation test and rank test algorithms, and analyze the complexity with respect to N and M for a given false-alarm probability (Pfa); also, the detection probability (Pd) will be evaluated for each case. Optimum values of N and M for a given Pfa will be given for the permutation test and the rank test, resulting in similar values of computational complexity of both of them, i.e. computational complexity proportional to N (DOT) M. We also show the detectability curves of the optimum permutation test versus optimum rank test under Gaussian noise environments for different values of N and M and different target models.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Francisco Alvarez-Vaquero and Jose L. Sanz-Gonzalez "Complexity analysis of permutation test versus rank test for nonparametric radar detection", Proc. SPIE 3161, Radar Processing, Technology, and Applications II, (24 September 1997);

Back to Top