Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On the Implementation of the Linearly Constrained Minimum Variance Beamformer

Jakobsson, Andreas LU orcid ; Alty, Stephen and Lambotharan, Sangarapillai (2006) In IEEE Transactions on Circuits and Systems II: Express Briefs 53(10). p.1059-1062
Abstract
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.
Please use this url to cite or link to this publication:
author
; and
publishing date
type
Contribution to journal
publication status
published
subject
keywords
adaptive signal processing, array signal processing, efficient implementation, linearly constrained minimum variance, ALGORITHM
in
IEEE Transactions on Circuits and Systems II: Express Briefs
volume
53
issue
10
pages
1059 - 1062
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • scopus:33750577143
ISSN
1549-7747
DOI
10.1109/TCSII.2006.882228
language
English
LU publication?
no
id
f87cfd8d-5530-4926-a82b-b38b4655dfc1 (old id 1216159)
alternative location
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1715577
date added to LUP
2016-04-01 15:59:12
date last changed
2022-02-12 18:59:38
@article{f87cfd8d-5530-4926-a82b-b38b4655dfc1,
  abstract     = {{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.}},
  author       = {{Jakobsson, Andreas and Alty, Stephen and Lambotharan, Sangarapillai}},
  issn         = {{1549-7747}},
  keywords     = {{adaptive signal processing; array signal processing; efficient implementation; linearly constrained minimum variance; ALGORITHM}},
  language     = {{eng}},
  number       = {{10}},
  pages        = {{1059--1062}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Transactions on Circuits and Systems II: Express Briefs}},
  title        = {{On the Implementation of the Linearly Constrained Minimum Variance Beamformer}},
  url          = {{http://dx.doi.org/10.1109/TCSII.2006.882228}},
  doi          = {{10.1109/TCSII.2006.882228}},
  volume       = {{53}},
  year         = {{2006}},
}