Combination of Approximate P0-Norm Regularized Multiple Adaptive Lattice Filters in Sparse Cognitive Radio Channel Identification
Özet
A priori recursive least squares (RLS) lattice algorithm has been regularized by adding an approximation of ?0-norm constraint penalty term to the cost function so as to introduce sparsity awareness to the previously proposed lattice filter combination schemes, i.e., Regular Combination of Multiple Lattice Filters (R-CMLF) and Decoupled Combination of Multiple Lattice Filter (D-CMLF) schemes, in cognitive radio (CR) channel identification framework. Fast convergence and low steady state mean square deviation (MSD) performance under sparse channel conditions has been brought together with the use of different exponential weighting factors in sparsity aware component filters. The performances of lattice component filters with sparsity aware algorithms under white and colored Gaussian input signal conditions are demonstrated by means of MSD simulations, and the performances of combination filters of the proposed schemes have been compared against those of the ? 1-norm Regularized R-CMLF (? 1}-\mathrm {R}-\mathrm {R-CMLF) and D-CMLF (? 1-R-D-CMLF) schemes, and approximately ?0-norm as Well as ? 1-norm Regularized Combinations of Least Mean Square Filters (?0-and ? 1}-{R-CLMSF) schemes. © 2020 IEEE.
