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 traditional search algorithm. This new approach is compared via simulation with conventional narrowband beamforming.