Abstract

The prospect of massive deployment of devices for Internet-of-Things (IoT) motivates grant-free access for simultaneously uplink transmission by multiple nodes. Blind demixing represents a promising technique for recovering multiple such source signals over unknown channels. Recent studies show Wirtinger Flow (WF) algorithm can be effective in blind demixing. However, existing theoretical results on WF step size selection tend to be conservative and slow down convergence rates. To overcome this limitation, we propose an improved WF (WF-OPT) by optimizing its step size in each iteration and expediting the convergence. We provide a theoretical guarantee on the strict contraction of WF-OPT and present the upper bounds of the contraction ratio. Simulation results demonstrate the expected convergence gains.

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.