Localization of multiple broadband targets via frequency domain adaptive beamforming for planar arrays
Ziomek, Lawrence J.
Behrle, Charles D.
MetadataShow full item record
Computer simulation studies of a frequency domain adaptive beamforming algorithm for planar arrays are presented. The algorithm, which can localize multiple broadband targets, is a modified complex least‐mean‐square (LMS) adaptive algorithm, and can process an arbitrary number of harmonics. The algorithm provides estimates of both the depression and bearing angles of incident plane‐wave fields. Computer simulation results are presented comparing the average depression and bearing angle estimation errors as a function of the input signal‐to‐noise ratio (SNR) at a single element in the array, sampling rate, and harmonic number. The ‘‘full angular coverage’’ capability of the algorithm was also tested.
The article of record as published may be found at https://doi.org/10.1121/1.397454
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Tan, Ko-Cheng (Monterey, California. Naval Postgraduate School, 1996-06);Motion planning and control of a Nomad 200 mobile robot are studied in this thesis. The objective is to develop a motion planning and control algorithm that is able to move the robot from an initial configuration (position ...