L1-Constrained Normalized LMS Algorithms for Adaptive Beamforming

We detail in this paper an L-1-norm Linearly constrained normalized least-mean-square (L-1-CNLMS) algorithm and its weighted version (L-1-WCNLMS) applied to solve problems whose solutions have some degree of sparsity, such as the beam-forming problem in uniform linear arrays, standard hexagonal arrays, and (non-standard) hexagonal antenna arrays. In addition to the linear constraints present in the CNLMS algorithm, the L-1-WCNLMS and the L-1-CNLMS algorithms take into account an L-1-norm penalty on the filter coefficients, which results in sparse solutions producing thinned arrays. The effectiveness of both algorithms is demonstrated via computer simulations. When employing these algorithms to antenna array problems, the resulting effect due to the -norm constraint is perceived as a large aperture array with few active elements. Although this work focuses the algorithm on antenna array synthesis, its application is not limited to them, i.e., the L-1-CNLMS is suitable to solve other problems like sparse system identification and signal reconstruction, where the weighted version, the L-1-WCNLMS algorithm, presents superior performance compared to the L-1-CNLMS algorithm.