. 21 30
) 21 (
) 1 (
!" #
) 2 (
) 1 % &’( ( ) * +,- ./ %’0 +1 23 %4 &5 678
) 2 ( ) * +,- ./ %’0 +1 23 %4 &5 678
::5 ; <=/ 1392 :?@ ; 0/ 1393
:&#’( 2A3 BC 6% D/ + E-( E :% / :7FGH %3 I .%-
/ %%J ? K D L DM E- H%4 5 / :7FGH %3 D/ :N=- D(
( E :7FGH %3 D/ :N=- :% + E- H%4 ? L .%/ D’O P/ / D’70/ DQ= K
/ +% %N B%8 DQ= K D/ B%8 7R D’70/ DQ= D( % %C + <,- D L .: B%8 7R %7H DN
: D/ +% +%’ < .%*
:)"*+ ,-*+ SJ3 <%/ ; / E- H%4 +%’ :7FGH %3 Convex Optimization .
Robust Beamforming Algorithms
Sajad Dehqani
(1)
– Naser Parhizgar
(2)
(1) MSc - Department of Electrical Engineering, Science and Research Branch, Islamic Azad University,
Fars, Iran
sajaddehghani@gmail.com
(2) Assistant Professor - Department of Electrical Engineering, Science and Research Branch, Islamic Azad
University, Fars, Iran
nasserpar@yahoo.com
Adaptive beamforming methods are known to degrade in the presence of steering vector and covariance
matrix uncertinity. In this paper, a new approach is presented to robust adaptive minimum variance
distortionless response beamforming make robust against both uncertainties in steering vector and
covariance matrix. This method minimize a optimization problem that contains a quadratic objective
function and a quadratic constraint. The optimization problem is nonconvex but is converted to a convex
optimization problem in this paper. It is solved by the interior-point method and optimum weight vector to
robust beamforming is achieved.
Index Terms: Robustness, uncertainty, minimum variance distortionless response beamforming, convex
optimization.
:./0 1)20 - T &5 < 23 %4 ) * +,- &5 678 ، sajaddehghani@gmail.com