Abstract
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)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
