Sensor selection for sparse source detection in planar arrays. Issue 7 (1st April 2019)

• Record Type: Journal Article
• Authors: Ajorloo, A.; Amiri, R.; Bastani, M.H.; Amini, A.
• Is Part Of: Electronics letters. Volume 55:Issue 7(2019)
• Page Start: 411
• Page End: 413
• Publication Date: 2019-04-01
• Subjects: minimisation -- optimisation -- compressed sensing -- matrix algebra -- convex programming; sparse source detection -- planar array -- redundant -- source space -- compressive sensing methods -- detection performance -- sensor selection method; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2018.7952
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : The sensor selection is a technique to reduce the cost, energy consumption, and complexity of a system by discarding redundant or less useful sensors. In this technique, one attempts to select a subset of sensors within a larger set so as to optimise a performance criterion. In this work, the authors consider the detection of sources in the 3D space when the source space could be sparsely represented. The application of compressive sensing (CS) methods in this setting has been extensively studied. Their aim in this work is to carry out the task of sensor selection in a planar array without sacrificing the detection performance. Their approach is to adopt the equivalent CS model and reduce the mutual coherence of the associated sensing matrix. This minimisation task is non‐convex, for which they propose a convex relaxation. Numerical simulations demonstrate that the gap between their relaxed solution and its optimal counterpart is negligible. The proposed sensor selection method is also shown to outperform the uniform approach in terms of source detection.