Title On the Implementation of the Linearly Constrained Minimum Variance Beamformer
Authors Andreas Jakobsson, Stephen Alty, Sangarapillai Lambotharan
Full-text Available as PDF, Restricted Access
Alternative Location http://ieeexplore.ieee.org/..., Restricted Access
Alternative Location http://dx.doi.org/10.1109/T...
Publication IEEE Transactions on Circuits and Systems II
Year 2006
Volume 53
Issue 10
Pages 1059 - 1062
Document type Article
Status Published
Quality controlled Yes
Language eng
Publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC,
Abstract English The linearly constrained minimum variance (LCMV) method, which allows multiple linear constraints, is an extension of the classical minimum variance distortionless response filter. Depending on the spatial filter length and the desired frequency grid, a direct computation of the resulting spatial beam pattern may be prohibitive. This brief exploits the rich structure of the LCMV expression to find a nonrecursive computationally efficient implementation of the LCMV beamformer with fixed constraints. The implementation is formed via the use of the matrix inversion lemma and the fast Fourier transform. Numerical simulations indicate a dramatic computational gain, especially for fine frequency grids and multiple constraints.
Keywords adaptive signal processing, array signal processing, efficient implementation, linearly constrained minimum variance, ALGORITHM,
ISBN/ISSN/Other ISSN: 1057-7130

Questions: webmaster
Last update: 2013-04-11

Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Telefon: +46 46-222 00 00 (vx)