Stable Blind Deconvolution over the Reals from Additional Autocorrelations

Recently the one-dimensional time-discrete blind deconvolution problem was shown to be solvable uniquely, up to a global phase, by a semi-definite program for almost any signal, provided its autocorrelation is known. We will show in this work that under a sufficient zero separation of the corresponding signal in the $z-$domain, a stable reconstruction against additive noise is possible. Moreover, the stability constant depends on the signal dimension and on the signals magnitude of the first and last coefficients. We give an analytical expression for this constant by using spectral bounds of Vandermonde matrices.

[1]  L. Demanet,et al.  Stable Optimizationless Recovery from Phaseless Linear Measurements , 2012, Journal of Fourier Analysis and Applications.

[2]  T. Kailath,et al.  A least-squares approach to blind channel identification , 1995, IEEE Trans. Signal Process..

[3]  Karim Abed-Meraim,et al.  Blind system identification , 1997, Proc. IEEE.

[4]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[5]  David Gross,et al.  Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.

[6]  Nirit Dudovich,et al.  Vectorial Phase Retrieval of 1-D Signals , 2013, IEEE Transactions on Signal Processing.

[7]  Peter Jung,et al.  Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication , 2014, ArXiv.

[8]  G. Plonka,et al.  Ambiguities in One-Dimensional Discrete Phase Retrieval from Fourier Magnitudes , 2015 .

[9]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[10]  Xiaodong Li,et al.  Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization , 2016, Applied and Computational Harmonic Analysis.

[11]  Yuanying Chen,et al.  Rapid evolution of piRNA clusters in the Drosophila melanogaster ovary , 2023, bioRxiv.

[12]  Peter Jung,et al.  On the Stability of Sparse Convolutions , 2014, ArXiv.

[13]  R. Tennant Algebra , 1941, Nature.

[14]  Felix Krahmer,et al.  Improved Recovery Guarantees for Phase Retrieval from Coded Diffraction Patterns , 2014, arXiv.org.

[15]  Zhi Ding,et al.  Ill-convergence of Godard blind equalizers in data communication systems , 1991, IEEE Trans. Commun..

[16]  Nicos Karcanias,et al.  Root regions of bounded coefficient polynomials , 1991 .

[17]  Babak Hassibi,et al.  Constrained blind deconvolution using Wirtinger flow methods , 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).

[18]  J. Merikoski,et al.  Inequalities for spreads of matrix sums and products. , 2004 .

[19]  Y. Bistritz,et al.  Bounds for resultants of univariate and bivariate polynomials , 2010 .

[20]  Richard Zippel,et al.  Effective polynomial computation , 1993, The Kluwer international series in engineering and computer science.

[21]  Kishore Jaganathan,et al.  Convex Programming-Based Phase Retrieval: Theory and Applications , 2016 .

[22]  H. W Capel,et al.  An inequality for the trace of matrix products , 1974 .

[23]  Dan Edidin,et al.  An algebraic characterization of injectivity in phase retrieval , 2013, ArXiv.

[24]  Michael Kech,et al.  Explicit Frames for Deterministic Phase Retrieval via PhaseLift , 2015, Applied and Computational Harmonic Analysis.

[25]  A. Güngör Some Bounds for the Product of Singular Values , 2007 .

[26]  Emmanuel J. Candès,et al.  PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming , 2011, ArXiv.

[27]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[28]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[29]  Yonina C. Eldar,et al.  Phase Retrieval via Matrix Completion , 2011, SIAM Rev..

[30]  Lang Tong,et al.  A new approach to blind identification and equalization of multipath channels , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[31]  Peter Jung,et al.  Blind Demixing and Deconvolution at Near-Optimal Rate , 2017, IEEE Transactions on Information Theory.

[32]  Dustin G. Mixon,et al.  Saving phase: Injectivity and stability for phase retrieval , 2013, 1302.4618.

[33]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[34]  B. Baumgartner An inequality for the trace of matrix products, using absolute values , 2011, 1106.6189.

[35]  Justin K. Romberg,et al.  Blind Deconvolution Using Convex Programming , 2012, IEEE Transactions on Information Theory.

[36]  Lang Tong,et al.  Blind channel identification based on second-order statistics: a frequency-domain approach , 1995, IEEE Trans. Inf. Theory.

[37]  Chrysostomos L. Nikias,et al.  EVAM: an eigenvector-based algorithm for multichannel blind deconvolution of input colored signals , 1995, IEEE Trans. Signal Process..

[38]  Babak Hassibi,et al.  Blind Deconvolution with Additional Autocorrelations via Convex Programs , 2017, ArXiv.

[39]  Babak Hassibi,et al.  Reconstruction of Signals From Their Autocorrelation and Cross-Correlation Vectors, With Applications to Phase Retrieval and Blind Channel Estimation , 2016, IEEE Transactions on Signal Processing.

[40]  Helmut Bölcskei,et al.  Vandermonde Matrices with Nodes in the Unit Disk and the Large Sieve , 2017, Applied and Computational Harmonic Analysis.