Advanced sonar algorithms with complex-wave propagation processing are of critical importance in the field of acoustic signal processing, as they possess the ability to localize signal sources more precisely in a cluttered environment. Conventional Matched-Field Processing (CMFP) is such an algorithm that provides range and depth results by employing environmental parameters. However, the enhancement of features is limited by the extensive computational and memory requirements of the algorithm even for a small problem size. High-performance computing, when applied to matched-field processing on a microprocessor-based distributed system, can provide solutions for this challenging problem in performance, scalability, and cost. Based on domain decomposition techniques, two parallel algorithms for matched-field processing are introduced in this paper for in-situ signal processing. Performance results collected on low-power distributed embedded systems are presented in terms of execution times and parallel efficiencies. The results of these analyses demonstrate that parallel in-situ processing holds the potential to meet the needs of matched-field processing in a scalable fashion.
[1]
R. G. Fizell,et al.
Source localization in range and depth in an Arctic environment
,
1985
.
[2]
V. D. Svet,et al.
Matched-field processing of signals in ocean waveguides (review)
,
1993
.
[3]
M. Porter,et al.
A numerical method for ocean‐acoustic normal modes
,
1984
.
[4]
Arthur B. Baggeroer,et al.
An overview of matched field methods in ocean acoustics
,
1993
.
[5]
W. Kuperman,et al.
Computational Ocean Acoustics
,
1994
.
[6]
H. Bucker.
Use of calculated sound fields and matched‐field detection to locate sound sources in shallow water
,
1976
.
[7]
Alan D. George,et al.
PARALLEL ALGORITHMS FOR SPLIT-APERTURE CONVENTIONAL BEAMFORMING
,
1999
.
[8]
P. Bergmann,et al.
THE PHYSICS OF SOUND IN THE SEA
,
1946
.
[9]
M. S. Babtlett.
Smoothing Periodograms from Time-Series with Continuous Spectra
,
1948,
Nature.