Adaptive Beamforming for Sparse Array Based on Semi-Definite Programming

被引:3
|
作者
Hu, Bin [1 ]
Wu, Xiaochuan [1 ]
Zhang, Xin [1 ]
Yang, Qiang [1 ]
Deng, Weibo [1 ]
机构
[1] Harbin Inst Technol, Sch Elect & Informat Engn, Key Lab Marine Environm Monitoring & Informat Pro, Minist Ind & Informat Technol, Harbin 150001, Heilongjiang, Peoples R China
来源
IEEE ACCESS | 2018年 / 6卷
基金
中国国家自然科学基金;
关键词
Compressed sensing; adaptive digital beamforming; gain/phase uncertainties; semi-definite programming-total least squares algorithm;
D O I
10.1109/ACCESS.2018.2878153
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An adaptive beamforming (ABF) technique for sparse receiving arrays with gain/phase uncertainties is proposed. The basic idea of the proposed method is using the compressed sensing theory to estimate directions and amplitudes of the received signals with sparse array and then obtain the covariance matrix of the signals through the estimated directions and amplitudes. However, on a discrete grid, the accuracy of directions and amplitudes estimation will degrade because of the basis mismatch and the existence of the gain/phase uncertainties. It will influence the performance of the adaptive digital beamforming. In order to eliminate the influence of the gain/phase uncertainties and the basis mismatch, we propose a semi-definite programming-total least squares (SDP-TLS) method in this paper. First, we convert the problem we want to solve into a TLS framework. Then, we develop an alternating descent algorithm to solve this problem. In the algorithm we proposed, the directions and amplitudes are estimated by semi-definite programming. The covariance matrix of the signals, which is used for ABF, is obtained by the estimated directions and amplitudes. Then, the adaptive digital beamforming algorithm is adopted to form a beam with the obtained covariance matrix.
引用
收藏
页码:64525 / 64532
页数:8
相关论文
共 50 条
  • [31] Double star orbits with semi-definite programming and alternatives
    Branham, R. L., Jr.
    ASTRONOMY & ASTROPHYSICS, 2009, 507 (02) : 1107 - 1115
  • [32] Learning linear PCA with convex semi-definite programming
    Tao, Qing
    Wu, Gao-wei
    Wang, Jue
    PATTERN RECOGNITION, 2007, 40 (10) : 2633 - 2640
  • [33] Best separable approximation with semi-definite programming method
    Jafarizadeh, MA
    Mirzaee, M
    Rezaee, M
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2004, 2 (04) : 541 - 558
  • [34] A Semi-Definite Programming Approach to Robust Adaptive MPC under State Dependent Uncertainty
    Bujarbaruah, Monimoy
    Nair, Siddharth H.
    Borrelli, Francesco
    2020 EUROPEAN CONTROL CONFERENCE (ECC 2020), 2020, : 960 - 965
  • [35] Using semi-definite programming to enhance supertree resolvability
    Moran, S
    Rao, S
    Snir, S
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2005, 3692 : 89 - 103
  • [36] Failure discrimination and rating of enterprises by semi-definite programming
    Konno H.
    Kobayashi H.
    Asia-Pacific Financial Markets, 2000, 7 (3) : 261 - 273
  • [37] Design of diamond and circular filters by semi-definite programming
    Hung, T. Q.
    Tuan, H. D.
    Nguyen, T. Q.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, 2007, : 2966 - +
  • [38] Mobile Sensor Mapping via Semi-Definite Programming
    Destino, Giuseppe
    Macagnano, Davide
    CONFERENCE RECORD OF THE 2014 FORTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2014, : 1521 - 1524
  • [39] The Analysis of Multivariate Data Using Semi-Definite Programming
    A.H. Al-Ibrahim
    Journal of Classification, 2015, 32 : 382 - 413
  • [40] Visualizing network communities with a semi-definite programming method
    Li, Wenye
    INFORMATION SCIENCES, 2015, 321 : 1 - 13