Novel efficient blind beamforming algorithm using cumulant optimization
Document Type
Conference Proceeding
Publication Date
12-1-2005
Abstract
Blind beamformers have drawn a lot of attention from signal processing researchers in the past decade. These new beamforming techniques based on the signal statistics can remove the restriction on the minimum-variance distortionless beamformers, such as the narrow bandwidth of source signals, the spectral distinction between the source signal and interference, etc. In this paper, we would like to propose a novel efficient blind beamforming algorithm based on the optimization of cumulants. Instead of the existing slow-converging steepest-descent-search algorithm, we derive a new iterative method to achieve the optimal solution. Empirically speaking, our new algorithm requires only a few iterations to reach a satisfactory result. Monte Carlo simulations also show that our iterative blind beamforming algorithm is robust over different signal-to-noise ratio conditions. © 2005 IEEE.
Publication Source (Journal or Book title)
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
First Page
85
Last Page
88
Recommended Citation
Wu, H., & Xu, D. (2005). Novel efficient blind beamforming algorithm using cumulant optimization. IEEE Antennas and Propagation Society, AP-S International Symposium (Digest), 4 B, 85-88. https://doi.org/10.1109/APS.2005.1552746