Research On The Performance Of Matched Field Processing Simulation

Because of the widely use of Matched Field Processing technology in the underwater acoustic source location, a series of Matched Field Processing algorithms appears, and every algorithm has different characteristics and application requirements, the paper analyzes the Matched Field Processing performance of some typical algorithms, and designs the software for Matched Field Processing passive location, which is using the mixed program language of VC++ and FORTRAN.First of all, the paper describes the basic theory of Matched Field Processing, mainly including the copies of field calculation, selection of cost function, as well as the basic principles of optimization algorithm. Copy field is calculated by the Normal Mode theory. Select four typical Matched Field Processing algorithms as the cost function, which includes the Minimum-Variance Processor, the Multiple Constraint Processor, and the Likelihood Processor with the variable coefficient two and three.Second, the paper considers two kinds of different environment of deep and shallow ocean, and simulates and analyzes the performance of four typical locating algorithms of the Matched Field Processing, which is based on the horizontal array, vertical array, and horizontal and vertical combinations array. Summarize the advantages and disadvantages of various algorithms, and then integrate these algorithms in the software algorithm library, in order to be called subsequent in convenience.Third, the traditional Matched Field Processing algorithm's computing speed is too slow, and inefficient, so the paper introduces the Genetic Algorithms as the optimization algorithm of matched field location, which ensures a good positioning accuracy, and improves the efficiency.Finally, use VC++ to program the software, and integrate the FORTRAN simulation program into the software to produce the software of matched field source localization. The software not only can simulate and analyze the Matched Field Processing algorithms in different parameters (including the environment parameters, the array parameters, etc.), but also can locate the source, and output the information of the source about range and depth.