Abstract
With the previously proposed non-uniform norm called lN-norm, which consists of a sequence of l1-norm or l0-norm elements according to relative magnitude, a novel lN-norm sparse recovery algorithm can be derived by projecting the gradient descent solution to the reconstruction feasible set. In order to gain analytical insights into the performance of this algorithm, in this letter we analyze the steady state mean square performance of the gradient projection lN-norm sparse recovery algorithm in terms of different sparsity, as well as additive noise. Numerical simulations are provided to verify the theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
