Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ACCESS.2018.2889877 | IEEE ACCESS |
Keywords | Field | DocType |
l(0)-norm,sparse controllable array,NLMS algorithm,constrained adaptive beamforming | Convergence (routing),Approximation algorithm,Beamforming,Sparse array,Adaptive beamformer,Normalization (statistics),Computer science,Algorithm,Antenna array,Distributed computing,Computation | Journal |
Volume | ISSN | Citations |
7 | 2169-3536 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wanlu Shi | 1 | 1 | 3.73 |
| Yingsong Li | 2 | 120 | 34.72 |
| Luyu Zhao | 3 | 1 | 1.05 |
| Xiaoguang Liu | 4 | 0 | 1.35 |