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, ESP, 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.

Creators(s): Liu, Wei, Koh, C.L. and Weiss, S. ORCID logoORCID: https://orcid.org/0000-0002-3486-7206;
Item type:Book Section
ID code:39618
Keywords:adaptive algorithm, adaptive signal processing , array signal processing , computational complexity , Electrical engineering. Electronics Nuclear engineering
Subjects:Technology > Electrical engineering. Electronics Nuclear engineering
Department:Faculty of Engineering > Electronic and Electrical Engineering
Depositing user: Pure Administrator
Date deposited:09 May 2012 10:52
Last modified:20 Jan 2021 15:25
URI:https://strathprints.strath.ac.uk/id/eprint/39618
Export data:
CORE (COnnecting REpositories)