A geometrical problem arising in a signal restoration algorithm (Q1282020)

The authors consider the Fourier pair reconstruction from partial data of \(f\in \mathbb{R}^{2N}\) and its discrete Fourier transform \(\widehat{f}\). Let \(L\) be the space of all \(f\in \mathbb{R}^{2N}\) with \(f(j)=0\) \((j=N,\dots, 2N-1)\). For fixed \(s\in L\), let \(K_s\) denote the cone of all \(f\in L\) with \(\arg \widehat{f}(k)= \arg \widehat{s}(k)\) \((k=0,\dots, 2N-1)\). Let \(M_s\) be the linear span of \(K_s\). The angle \(\alpha_s\) between \(M_s\) and \(L\) determines the convergence rate of the signal restoration from phase algorithm. The following results are proven by the authors: (i) \(\alpha_s\leq \pi/4\) for all \(s\in L\) with \(M_s\cap L= \text{span }\{s\}\). (ii) \(\alpha_s= \pi/4\) for geometric \(s\in L\), i.e., \(s(j)= q^j\) \((j= 0,\dots, N-1)\) with \(q\in \mathbb{R}\setminus \{\pm 1\}\).