By Topic

On the Implementation of the Linearly Constrained Minimum Variance Beamformer

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Jakobsson ; Dept. of Electr. Eng., Karlstad Univ. ; S. R. Alty ; S. Lambotharan

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

Published in:

IEEE Transactions on Circuits and Systems II: Express Briefs  (Volume:53 ,  Issue: 10 )