TY - GEN
T1 - Robust minimum sidelobe beamforming in mode space for circular arrays
AU - Wang, Yong
AU - Yang, Yixin
AU - Ma, Yuanliang
AU - Wang, Xiaoyu
PY - 2012
Y1 - 2012
N2 - Beamformer with low sidelobe is important in many applications, but its performance will degrade in the presence of errors in sensor array characteristics, such as position, gain and phase errors. White noise gain constraint is always used to improve the robustness, but it is not clear how to choose the related parameters according to the given level of errors. The robust method based on worst-case performance optimization can use the a priori knowledge of the error levels, but not sufficiently. The bounds of the manifold vector uncertainty set cannot be easily obtained. In this paper, a feasible way is used to derive the bounds considering the errors in sensor array characteristics together, and then a robust minimum sidelobe beamforming method based on worst-case performance optimization in mode space for circular arrays is presented. This problem can be transformed to convex optimization and solved by second-order cone programming. Simulation results show the computation load of this method is effectively reduced and the results are more reliable.
AB - Beamformer with low sidelobe is important in many applications, but its performance will degrade in the presence of errors in sensor array characteristics, such as position, gain and phase errors. White noise gain constraint is always used to improve the robustness, but it is not clear how to choose the related parameters according to the given level of errors. The robust method based on worst-case performance optimization can use the a priori knowledge of the error levels, but not sufficiently. The bounds of the manifold vector uncertainty set cannot be easily obtained. In this paper, a feasible way is used to derive the bounds considering the errors in sensor array characteristics together, and then a robust minimum sidelobe beamforming method based on worst-case performance optimization in mode space for circular arrays is presented. This problem can be transformed to convex optimization and solved by second-order cone programming. Simulation results show the computation load of this method is effectively reduced and the results are more reliable.
KW - beamforming
KW - circular arrays
KW - second-order cone programming
KW - worst-case performance optimization
UR - http://www.scopus.com/inward/record.url?scp=84869421884&partnerID=8YFLogxK
U2 - 10.1109/ICSPCC.2012.6335704
DO - 10.1109/ICSPCC.2012.6335704
M3 - 会议稿件
AN - SCOPUS:84869421884
SN - 9781467321938
T3 - 2012 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2012
SP - 300
EP - 304
BT - 2012 IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2012
T2 - 2012 2nd IEEE International Conference on Signal Processing, Communications and Computing, ICSPCC 2012
Y2 - 12 August 2012 through 15 August 2012
ER -