SOURCE LOCALIZATION IN A WAVE-GUIDE USING POLYNOMIAL ROOTING

Source localization in acoustic waveguides involves a multidimensional search procedure, In this paper, we propose a new algorithm in which the search in the depth direction is replaced by polynomial rooting. U sing the proposed algorithm, range and depth estimation by a vertical array requires a 1-D search procedure. For a 3-D localization problem (i.e., range, depth, and direction-of-arrival (DOA) estimation), the a lgorithm involves a 2-D search procedure. Consequently, the proposed a lgorithm requires significantly less computation than other methods th at are based on a brute-force search procedure over the source locatio n parameters. In order to evaluate the performance of the algorithm, a n error analysis is carried out, and Monte-Carlo simulations are perfo rmed, The results are compared with the Cramer-Rao bound (CRB) and to the maximum likelihood (ML) simulation performance, The algorithm is s hown to be efficient, while being computationally simpler than the ML or the Bartlett processors. The disadvantage of the algorithm is that its SNR threshold occurs in lower SNR than in the ML algorithm.