Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (2): 63-68.doi: 10.13190/j.jbupt.2016.02.013

• Reports • Previous Articles     Next Articles

Robust Constant Modulus Adaptive Beamforming Algorithm Based on Probability-Constrained Optimization

QIAN Hua-ming1, LIU Ke1, WANG Bing-zi2, MA Jun-da1   

  1. 1. College of Automation, Harbin Engineering University, Harbin 150001, China;
    2. Instrument First Branch, Daqing Petrochemical Construction Company, Heilongjiang Daqing 163714, China
  • Received:2015-05-28 Online:2016-04-28 Published:2016-04-28

Abstract:

This article combines probability-constrained optimization technique with constant modulus algorithm to study a new robust adaptive beamforming algorithm for constant modulus signals. Aiming at the two kinds of cases that steering vector mismatch follows the Gauss distribution and unknown distribution, the optimization cost functions are respectively built, and these optimization problems are changed to the second order cone (SOC) programming ones solved with interior point methods. Then, the convex analyses of the optimization problems are carried out as well. In the simulation, the proposed algorithm compares with related robust algorithms to demonstrate its superiority and effectiveness.

Key words: robust adaptive beamformer, probabilistic constraint, constant modulus algorithm, array steering vector errors

CLC Number: