LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Blind adaptive constrained constant modulus algorithms based on unscented Kalman filter for beamforming

Photo by martinadams from unsplash

This work proposes constrained constant modulus unscented Kalman filter (CCM-UKF) algorithm and its low-complexity version called reduced-rank constrained constant modulus unscented Kalman filter (RR-CCM-UKF) algorithm for blind adaptive beamforming. In… Click to show full abstract

This work proposes constrained constant modulus unscented Kalman filter (CCM-UKF) algorithm and its low-complexity version called reduced-rank constrained constant modulus unscented Kalman filter (RR-CCM-UKF) algorithm for blind adaptive beamforming. In the generalized sidelobe canceller (GSC) structure, the proposed algorithms are devised according to the CCM criterion. Firstly, the cost function of the constrained optimization problem is transformed to suit the Kalman filter-style state space model. Then, the optimum weight vector of the beamformer can be estimated by using the recursive formulas of UKF. In addition, the a priori parameters of UKF (system and measurement noises) are processed adaptively in the implementation. Simulation results demonstrate that the proposed algorithms outperform the existing methods in terms of convergence speeds, output signal-tointerference- plus-noise ratios (SINRs), mean-square deviations (MSDs) and robustness against steering mismatch.

Keywords: kalman; constrained constant; constant modulus; unscented kalman; kalman filter

Journal Title: Journal of Central South University
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.