Abstract: The article presents the simulation results of the time-spatial matched filtration algorithm in detail described in [1]. The features of the algorithm are presented on figures of the realized simulations. Firstly, the simulation results in case of jar field are described. Successively the realizability of different filtrations types within algorithms is presented. Next the possibility of the algorithm adaptation to nearfield is shown. The last of the presented properties are possibilities of the directions of arrival choice.