FFT-based joint bearing estimation

The least-squares estimate for the joint estimation of M directions-of-arrival in an array-processing scenario is rederived in a way that makes explicit use of the discrete Fourier transform. It is shown that the M-dimensional search algorithm can be made orders of magnitude faster than the traditio...

Full description

Saved in:
Bibliographic Details
Published inIEEE journal of oceanic engineering Vol. 27; no. 4; pp. 774 - 779
Main Author MacInnes, C.S.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.10.2002
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Acoustic signal processing
Acoustics
Array signal processing
Beamforming
Bearing
Brackish
Computer simulation
Direction of arrival estimation
Discrete Fourier transforms
Estimates
Exact sciences and technology
Fast Fourier transforms
Fourier transforms
Frequency
Freshwater
Fundamental areas of phenomenology (including applications)
Least squares method
Marine
Narrowband
Physics
Search algorithms
Sensor arrays
Sonar equipment
Underwater sound
Vectors
White noise
Least squares method
Discrete Fourier transformation
Signal processing
Acoustic antenna
Localization
Underwater acoustics
Beam forming
Online AccessGet full text

Cover

More Information
Summary:The least-squares estimate for the joint estimation of M directions-of-arrival in an array-processing scenario is rederived in a way that makes explicit use of the discrete Fourier transform. It is shown that the M-dimensional search algorithm can be made orders of magnitude faster than the traditional search algorithm. This new approach is compared via simulation with conventional narrowband beamforming.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0364-9059
1558-1691
DOI:10.1109/JOE.2002.806538