CONSTRUCTION OF HIGH-SPEED ALGORITHMS FOR LOCALIZATION OF RANDOM PULSED-POINT SOURCES WITH A PRIORI INFORMATION ABOUT THEIR INTENSITY
A. L. Reznik, A. A. Soloviev
Institute of Automation and Electrometry, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Keywords: localization algorithms, pulsed-point source
Abstract
This paper examines the design of algorithms that minimize the localization time of an unknown signal source that manifests itself by generating ultrashort (essentially instantaneous) pulses at random moments. The source being searched for is random in two respects: first, its position within the search interval is unknown, and second, the source generates pulses at random moments. The source is localized using a detector receiver capable of arbitrarily changing its viewing window at any moment in time. Optimal search algorithms are constructed for the case where the a priori probability density function of the source distribution is a two-level piecewise constant function. The optimal parameters of these algorithms are determined, including the expected execution time for each of them. It is proven that an optimal algorithm that takes into account a priori information about the intensity of the source being searched for is always more efficient than an algorithm for which this intensity is unknown.
|
