Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

Constrained adaptive broadband beamforming algorithm in frequency domain

Liu, Wei and Koh, C.L. and Weiss, S. (2004) Constrained adaptive broadband beamforming algorithm in frequency domain. In: Sensor Array and Multichannel Signal Processing Workshop Proceedings, 2004. IEEE, pp. 94-98. ISBN 0-7803-8545-4

Full text not available in this repository. (Request a copy from the Strathclyde author)

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 beam-forming 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) structure is also studied.