Abstract

Consider the scenario where a receiver acquires information (data) corrupted by interference and noise. Both the information and interference have a sparse structure. To fully exploit the individual sparse structure of the information and interference, the joint interference mitigation and data recovery is formulated as a sparse maximum likelihood estimation (MLE) problem which maximizes the associated likelihood function under individual sparsity levels (ISLs) constraints. We propose an alternating optimization (AO) recovery algorithm to solve the non- convex sparse MLE problem. Under certain restricted isometry property (RIP) conditions, we show that the proposed AO algorithm converges to the optimal solution of the sparse MLE problem. We also derive an upper bound of the corresponding estimation error for the information. Simulations show that the proposed solution achieves significant gain over various baselines. Index Terms—Compressive sensing, Interference mitigation

Full Text
Paper version not known

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 call

Disclaimer: 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.