"JOURNAL OF RADIOELECTRONICS" N 7, 2001

contents

full text

discussion

 

SUCCESSIVE AND DICHOTOMIZING SEARCH ALGORITHMS OPTIMIZATION BY MEANS OF DYNAMIC PROGRAMMING APPROACH

 

A.G. Filatov

Voronezh Research Institute of Communications, Voronezh, Russia

 

Received May 17, 2001

 

To receive the potential characteristics of the successive and dichotomizing search algorithms dynamic programming approach was considered. It was shown that most valuable effect is reached within dichotomizing search optimization. Comparative analysis of search algorithms performance was carried out showing the gain of the dichotomizing algorithm in the wide range of the signal to noise ratio values. 

 

xxx