Faster than Fast: Accelerating the Griffin-Lim Algorithm
From MaRDI portal
Publication:6434286
arXiv2304.12905MaRDI QIDQ6434286FDOQ6434286
Authors: Rossen Nenov, Dang-Khoa Nguyen, Péter Balázs 
Publication date: 25 April 2023
Abstract: The phase retrieval problem is found in various areas of applications of engineering and applied physics. It is also a very active field of research in mathematics, signal processing and machine learning. In this paper, we present an accelerated version of the well known Fast Griffin-Lim algorithm (FGLA) for the phase retrieval problem in a general setting. It has increased the speed of convergence, and most importantly, the limit points of the generated sequence can reach a significantly smaller error than the ones generated by FGLA. We will give a motivation of the acceleration and compare it numerically to its predecessors and other algorithms typically used to solve similar problems.
This page was built for publication: Faster than Fast: Accelerating the Griffin-Lim Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434286)
