Self-calibration and biconvex compressive sensing. (30th September 2015)

• Record Type: Journal Article
• Authors: Ling, Shuyang; Strohmer, Thomas
• Is Part Of: Inverse problems. Volume 31:Number 11(2015:Nov.)
• Publication Date: 2015-09-30
• Subjects: self-calibration -- compressive sensing -- matrix completion -- convex programming -- biconvex optimization -- sparsity -- random matrix; Inverse problems (Differential equations) -- Periodicals; 515.357
• DOI: 10.1088/0266-5611/31/11/115002
• Languages: English
• ISSNs: 0266-5611

Abstract

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 where both and the diagonal matrix (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 and 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.