Radar systems have been very effective in gathering information in a battlefield, so that the tactical actions can be decided. On the contrary, self-protection systems have been developed to break this activity of radars, for which radar signals must be intercepted to be able to take counter measures on time. Ideally, interception should be done in a certain time with a 100% probability, but in reality this is not the case. To intercept radar signals in shortest time with the highest probability, a search strategy should be developed for the receiver. This thesis studies the conditions under which the intercept time increases and the probability of intercept decreases. Moreover, it investigates the performance of the search strategy of Clarkson with respect to these conditions, which assumes that a priori knowledge about the radars that will be intercepted is available. Then, the study identifies the cases where the search strategy of Clarkson may be not desirable according to tactical necessities, and proposes a probabilistic search strategy, in which it is possible to intercept radar signals with a specified probability in a certain time.

No description available.