%0 Electronic Article
%A R. Zelenovsky
%+ Dept. of Electr. Eng., Univ. of Brasilia, Brasilia
%A R.C. de Lamare
%+ Dept. of Electr. Eng., Univ. of Brasilia, Brasilia
%K set-membership filtering framework
%K SMF-WL algorithms
%K set-membership constrained widely linear beamforming algorithms
%K widely linear constrained minimum variance beamforming algorithms
%K least-mean square
%K recursive least squares
%K RLS
%K LMS
%X This paper proposes a widely linear (WL) constrained minimum variance beamforming algorithms based on the set-membership filtering (SMF) framework. The proposed SMF-WL algorithms have the advantages of the widely linear processing concept and keep the computational cost low with the SMF technique. We present two versions: one using least-mean square (LMS) and another using recursive least squares (RLS) recursions. It is shown that the proposed algorithms have better steady state and convergence performances with a lower computational cost when compared with existing methods. (5 pages)
%T Set-membership constrained widely linear beamforming algorithms
%B IET Conference Proceedings
%D January 2012
%P 10-10
%I Institution of Engineering and Technology
%U https://digital-library.theiet.org/;jsessionid=1kcdel93ae4nj.x-iet-live-01content/conferences/10.1049/ic.2012.0097
%G EN