Self-Calibration and Biconvex Compressive Sensing

Abstract

The design of high-precision sensing devises becomes ever more difficult and expensive. At the same time, the need for precise calibration of these devices (ranging from tiny sensors to space telescopes) manifests itself as a major roadblock in many scientific and technological endeavors. To achieve optimal performance of advanced high-performance sensors one must carefully calibrate them, which is often difficult or even impossible to do in practice. In this work we bring together three seemingly unrelated concepts, namely Self-Calibration, Compressive Sensing, and Biconvex Optimization. The idea behind self-calibration is to equip a hardware device with a smart algorithm that can compensate automatically for the lack of calibration. We show how several self-calibration problems can be treated efficiently within the framework of biconvex compressive sensing via a new method called SparseLift. More specifically, we consider a linear system of equations y = DAx, where both x and the diagonal matrix D (which models the calibration error) are unknown. By "lifting" this biconvex inverse problem we arrive at a convex optimization problem. By exploiting sparsity in the signal model, we derive explicit theoretical guarantees under which both x and D can be recovered exactly, robustly, and numerically efficiently via linear programming. Applications in array calibration and wireless communications are discussed and numerical simulations are presented, confirming and complementing our theoretical analysis.

References in corpus (1)

• Sparsity and Incoherence in Compressive Sampling

Cited by in corpus (56)

• An overview of low-rank matrix recovery from incomplete observations
• Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
• Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
• Guaranteed Blind Sparse Spikes Deconvolution via Lifting and Convex Optimization
• Self-Calibration Methods for Uncontrolled Environments in Sensor Networks: A Reference Survey
• The Numerics of Phase Retrieval
• Compressed Sensing and Parallel Acquisition
• Blind Identification of Graph Filters
• Parametric Bilinear Generalized Approximate Message Passing
• Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization
• Approximate Message Passing with Unitary Transformation for Robust Bilinear Recovery
• Signal Recovery from Unlabeled Samples
• Plug-in Estimation in High-Dimensional Linear Inverse Problems: A Rigorous Analysis
• Swift-Link: A compressive beam alignment algorithm for practical mmWave radios
• Bilinear Recovery using Adaptive Vector-AMP
• On Distributed Non-convex Optimization: Projected Subgradient Method For Weakly Convex Problems in Networks
• Low-rank spectral optimization via gauge duality
• Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
• A compressive channel estimation technique robust to synchronization impairments
• Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
• A Non-Convex Blind Calibration Method for Randomised Sensing Strategies
• Proximal Gradient Algorithms: Applications in Signal Processing
• Composite optimization for robust blind deconvolution
• Simultaneous Sparse Recovery and Blind Demodulation
• Joint CFO and Channel Estimation in Millimeter Wave Systems with One-Bit ADCs
• Sparse Blind Deconvolution and Demixing Through ${\ell }_{1,2}$-Minimization
• Convolutional Phase Retrieval via Gradient Descent
• Improving compressed sensing with the diamond norm
• Global Guarantees for Blind Demodulation with Generative Priors
• Identifiability in Blind Deconvolution with Subspace or Sparsity Constraints
• Regularized Gradient Descent: A Nonconvex Recipe for Fast Joint Blind Deconvolution and Demixing
• Structured Local Optima in Sparse Blind Deconvolution
• Support Recovery for Sparse Signals with Unknown Non-stationary Modulation
• Timely and Painless Breakups: Off-the-grid Blind Message Recovery and Users' Demixing
• BranchHull: Convex bilinear inversion from the entrywise product of signals with known signs
• Recovering Structured Data From Superimposed Non-Linear Measurements
• Bilinear Compressed Sensing under known Signs via Convex Programming
• Blind Demixing and Deconvolution at Near-Optimal Rate
• Gain and phase calibration of sensor arrays from ambient noise by cross-spectral measurements fitting
• Blind Identification of Invertible Graph Filters with Multiple Sparse Inputs
• Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently
• Short-and-Sparse Deconvolution -- A Geometric Approach
• Empirical Chaos Processes and Blind Deconvolution
• From Blind deconvolution to Blind Super-Resolution through convex programming
• Message passing-based joint CFO and channel estimation in millimeter wave systems with one-bit ADCs
• Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution under Random Designs
• Multichannel Sparse Blind Deconvolution on the Sphere
• Super-Resolution of Complex Exponentials from Modulations with Unknown Waveforms
• Signal Recovery in Perturbed Fourier Compressed Sensing
• Joint Block Low Rank and Sparse Matrix Recovery in Array Self-Calibration Off-Grid DoA Estimation
• A convex program for bilinear inversion of sparse vectors
• Fast and Accurate Amplitude Demodulation of Wideband Signals
• A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
• Guaranteed blind deconvolution and demixing via hierarchically sparse reconstruction
• Rank-One Measurements of Low-Rank PSD Matrices Have Small Feasible Sets
• Broadband Synchronization and Compressive Channel Estimation for Hybrid mmWave MIMO Systems