Performance and complexity comparison of broadband beamforming structures

In this paper, we compare low cost implementations of broadband adaptive beamformers, specifically the generalised sidelobe canceller, using least-mean squares type algorithms. DFT based techniques suffer from unjustified narrowband assumptions, or in case of overlap-save implementations, from potential slow convergence. Subband techniques offer a more robust convergence traded-off for a somewhat higher computational cost. Simulation results revealing some of the algorithms´ properties are presented.