Abstract
Reconstructing the original complex signal using amplitude-only measurements is referred to as the phase retrieval problem. In this paper, we develop a fast-iterative phase retrieval algorithm that can be considered as an enhanced version of the well-known Wirtinger Flow (WF) algorithm. The original WF algorithm is based on gradient descent scheme to tackle the phase recovery problem, however, the convergence speed of this WF algorithm is very slow. Compared with the original WF algorithm, the proposed fast-iterative WF (FWF) algorithm has a faster convergence speed, with an acceptable little more computational complexity. The proposed FWF algorithm is preferable not only due to its accelerated convergence speed but also due to its ability to converge to the global optimum. Experimental results show that the FWF algorithm is superior to the state-of-the-art algorithms in terms of the convergence speed.
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 callMore From: DEStech Transactions on Computer Science and Engineering
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.
