Open Access
2014 Optimal Spatial Matrix Filter Design for Array Signal Preprocessing
Haiyong Zhang, Dong Han, Kai Ji, Zhong Ren, Chi Xu, Lijuan Zhu, Hongyan Tan
J. Appl. Math. 2014(SI11): 1-8 (2014). DOI: 10.1155/2014/564976

Abstract

An efficient technique of designing spatial matrix filter for array signal preprocessing based on convex programming was proposed. Five methods were considered for designing the filter. In design method 1, we minimized the passband fidelity subject to the controlled overall stopband attenuation level. In design method 2, the objective function and the constraint in the design method 1 were reversed. In design method 3, the optimal matrix filter which has the general mean square error was considered. In design method 4, the left stopband and the right stopband were constrained with specific attenuation level each, and the minimized passband fidelity was received. In design method 5, the optimization objective function was the sum of the left stopband and the right stopband attenuation levels with the weighting factors 1 and γ, respectively, and the passband fidelity was the constraints. The optimal solution of the optimizations above was derived by the Lagrange multiplier theory. The relations between the optimal solutions were analyzed. The generalized singular value decomposition was introduced to simplify the optimal solution of design methods 1 and 2 and enhanced the efficiency of solving the Lagrange multipliers. By simulations, it could be found that the proposed method was effective for designing the spatial matrix filter.

Citation

Download Citation

Haiyong Zhang. Dong Han. Kai Ji. Zhong Ren. Chi Xu. Lijuan Zhu. Hongyan Tan. "Optimal Spatial Matrix Filter Design for Array Signal Preprocessing." J. Appl. Math. 2014 (SI11) 1 - 8, 2014. https://doi.org/10.1155/2014/564976

Information

Published: 2014
First available in Project Euclid: 1 October 2014

zbMATH: 07131692
Digital Object Identifier: 10.1155/2014/564976

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI11 • 2014
Back to Top