TY - JOUR
T1 - Beamforming via Nonconvex Linear Regression
AU - Jiang, Xue
AU - Zeng, Wen-Jun
AU - So, Hing Cheung
AU - Zoubir, Abdelhak M.
AU - Kirubarajan, Thiagalingam
PY - 2016/4/1
Y1 - 2016/4/1
N2 - Impulsive processes frequently occur in many fields, such as radar, sonar, communications, audio and speech processing, and biomedical engineering. In this paper, we propose a nonconvex linear regression (NLR) based minimum dispersion beamforming technique for impulsive signals to achieve significant performance improvement over the conventional minimum variance beamformer. The proposed beamformer minimizes the ℓp-norm of the output with p <1 subject to a linear distortionless response constraint, resulting in a difficult nonconvex and nonsmooth optimization problem. The constrained optimization problem is first reduced to a multivariate linear regression via constraint elimination. As a major contribution of this paper, a coordinate descent algorithm (CDA) is devised for solving the resultant NLR problem of ℓp-minimization with p <1 at a computational complexity of O(MN2), where M is the number of sensors and N is the sample size. At each inner iteration of the CDA, an efficient algorithm is designed to find the global minimum of each subproblem of univariate linear regression. The convergence of the CDA is analyzed. The NLR beamformer with a single constraint is further generalized to the case of multiple linear constraints, which is robust against model mismatch. Simulation results demonstrate the superior performance of nonconvex optimization based beamformer.
AB - Impulsive processes frequently occur in many fields, such as radar, sonar, communications, audio and speech processing, and biomedical engineering. In this paper, we propose a nonconvex linear regression (NLR) based minimum dispersion beamforming technique for impulsive signals to achieve significant performance improvement over the conventional minimum variance beamformer. The proposed beamformer minimizes the ℓp-norm of the output with p <1 subject to a linear distortionless response constraint, resulting in a difficult nonconvex and nonsmooth optimization problem. The constrained optimization problem is first reduced to a multivariate linear regression via constraint elimination. As a major contribution of this paper, a coordinate descent algorithm (CDA) is devised for solving the resultant NLR problem of ℓp-minimization with p <1 at a computational complexity of O(MN2), where M is the number of sensors and N is the sample size. At each inner iteration of the CDA, an efficient algorithm is designed to find the global minimum of each subproblem of univariate linear regression. The convergence of the CDA is analyzed. The NLR beamformer with a single constraint is further generalized to the case of multiple linear constraints, which is robust against model mismatch. Simulation results demonstrate the superior performance of nonconvex optimization based beamformer.
KW - Adaptive beamforming
KW - coordinate descent
KW - impulsive signal
KW - linear regression
KW - nonconvex optimization
KW - ℓp-norm minimization
UR - http://www.scopus.com/inward/record.url?scp=84962013886&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84962013886&origin=recordpage
U2 - 10.1109/TSP.2015.2507543
DO - 10.1109/TSP.2015.2507543
M3 - RGC 21 - Publication in refereed journal
SN - 1053-587X
VL - 64
SP - 1714
EP - 1728
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 7
M1 - 7352360
ER -