Non-Negative Matrix Factorization Based UKF Algorithm for Constant Modulus Signals in Adaptive Beamforming

HTML  XML Download Download as PDF (Size: 1160KB)  PP. 119-127  
DOI: 10.4236/ojapr.2016.43009    1,552 Downloads   2,325 Views  Citations

ABSTRACT

Blind adaptive beamforming is getting appreciated for its various applications in contemporary communication systems where sources are statistically dependent or independent that are allowed to formulate new algorithms. Qualitative performance and time complexity are the main issues. In this paper, we propose a technique for constant modulus signals applying basic non-negative matrix factorization (BNMF) in blind adaptive beamforming environment. We compared the existing Unscented Kalman Filter based Constant Modulus Algorithm (UKF-CMA) with proposed NMF-UKF-CMA algorithm. We see there is a better improvement of sensor array gain, signal to interference plus noise ratio (SINR) and mean squared deviation (MSD) as the noise variance and the array size increase with reduced computational complexity with the UKF-CMA.

Share and Cite:

Vignesh, R. and Narayanankutty, K. (2016) Non-Negative Matrix Factorization Based UKF Algorithm for Constant Modulus Signals in Adaptive Beamforming. Open Journal of Antennas and Propagation, 4, 119-127. doi: 10.4236/ojapr.2016.43009.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.