Abstract
We propose an $l_{0}$ -norm constrained normalized least-mean-square (CNLMS) adaptive beamforming algorithm for controllable sparse antenna arrays. To control the sparsity of the antenna array, an $l_{0}$ -norm penalty is used as a constraint in the CNLMS algorithm. The proposed algorithm inherits the advantages of the CNLMS algorithm in beamforming. The $l_{0}$ -norm constraint can force the quantities of antennas to a certain number to control the sparsity by selecting a suitable parameter. In addition, the proposed algorithm accelerates the convergence process compared with the existing algorithms in sparse array beamforming, and its convergence is presented in this paper. To reduce the computation burden, an approximating $l_{0}$ -norm method is employed. The performance of the proposed algorithm is analyzed through simulations for various array configurations.
Funding Information
  • National Key Research and Development Program of China (2016YFE0111100)
  • Key Research and Development Program of Heilongjiang (GX17A016)
  • Science and Technology innovative Talents Foundation of Harbin (2016RAXXJ044)
  • Natural Science Foundation of Beijing Municipality (4182077)
  • China Postdoctoral Science Foundation (2017M620918)
  • National Natural Science Foundation of China (61701366)
  • Fundamental Research Funds for the Central Universities (HEUCFM180806)

This publication has 34 references indexed in Scilit: