1971
DOI: 10.1190/1.1440187
|View full text |Cite
|
Sign up to set email alerts
|

Multiple‐constraint Adaptive Filtering

Abstract: An algorithm is derived for multichannel time‐series data processing, which maintains specified initial multiple filter constraints for known signal or noise sources while simultaneously adapting the filter to minimize the effect of the unknown noise field. Problems of implementing the technique such as convergence, determination of a starting filter, and comparison of results with conventional filters are discussed and illustrated with data from a vertical seismic array. The procedure is shown to be stable an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(14 citation statements)
references
References 0 publications
0
14
0
Order By: Relevance
“…In [13]- [20], the linear constraint of the MVDR in (3) has been generalized to a set of linear constraints as subject to (7) where is an matrix and is an vector. The solution can be found by using the Lagrange multiplication method as This is called the LCMV beamformer.…”
Section: B Lcmv Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…In [13]- [20], the linear constraint of the MVDR in (3) has been generalized to a set of linear constraints as subject to (7) where is an matrix and is an vector. The solution can be found by using the Lagrange multiplication method as This is called the LCMV beamformer.…”
Section: B Lcmv Methodsmentioning
confidence: 99%
“…We first loosen the constraint by choosing only two constraints and from the infinite constraints for . The corresponding optimization problem can be written as subject to and (13) Due to the fact that the constraint is loosened, the minimum to this problem is a lowerbound of the original problem in (11). Note that the constraint in (13) is a nonconvex quadratic constraint.…”
Section: B Two-point Quadratic Constraintmentioning
confidence: 99%
See 2 more Smart Citations
“…However, both the two methods require the error bound of steering vector which is hard to preset in some practical applications. The linear constraint minimum variance (LCMV) method uses equality linear constraints to force the responses near the DOA of SOI to be unity, which broadens the main lobe of the beampattern and improves the robustness of adaptive beamforming against DOA mismatch [20,21]. However, the LCMV beamformer could not achieve the best SINR performance due to the deviation between the optimal array responses and the preset unity-ones in the constrained directions.…”
Section: Introductionmentioning
confidence: 99%