Constrained Adaptive Broadband Beamforming Algorithm in Frequency Domain

Download

PDF Restricted to Registered users only Download (92Kb)

Description/Abstract

In this paper, the linearly constrained minimum variance (LCMV) beamforming problem is formulated in the frequency domain based on the time-domain formulation of the cost function and the constraints. We then derive a frequency-domain constrained adaptive broadband beamforming algorithm, which has a much lower computational complexity than the time-domain algorithm, although it suffers from a slower convergence speed, as shown by simulations. It is however an attractive option when the implementation of the time-domain algorithm is prohibitive due to large computational complexity. An alternative implementation of this constrained frequency-domain algorithm using the generalised sidelobe canceller (GSC) is also studied.