Adaptive beamforming with hierarchical subspace decomposition

This paper presents a generalized sidelobe canceller (GSC)-based adaptive beam- former, in which the signals passing through the lower branch of the GSC are separated into different layers of subspaces. With such a hierarchical subspace decomposition, the computational overhead required by the beamformer can be reduced and the convergence rate in adaptive processing scenarios can be enhanced. Simulations are conducted to verify the superiority of the new beamformer.

[1]  Ju-Hong Lee,et al.  Efficient adaptive array beamforming under steering errors , 1992, IEEE Antennas and Propagation Society International Symposium 1992 Digest.

[2]  Paulo S. R. Diniz,et al.  Adaptive Filtering: Algorithms and Practical Implementation , 1997 .

[3]  Tai-Kuo Woo.  Fast hierarchical least mean square algorithm , 2001, IEEE Signal Processing Letters.

[4]  J. S. Goldstein,et al.  Subspace selection for partially adaptive sensor array processing , 1997, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  L. J. Griffiths,et al.  An alternative approach to linearly constrained adaptive beamforming , 1982 .