Application Analysis of Compressive Sensing/Sampling Theory on Source Localization

Article Preview

Abstract:

In this paper, we consider the source localization problem with Compressive Sensing/Sampling (CS) Theory. CS Theory asserts one can reconstruct sparse or compressible signals from a very limited number of measurements. A necessary condition relies on properties of the sensing matrix such as the restricted isometry property (RIP). This paper explains why sparse construction can be used in source localization with RIP conception.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1409-1412

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. Candes and T. Tao. Decoding by linear programming: IEEE Trans. Inf. Theory. Vol. 51 (2005), p.4203–4215.

DOI: 10.1109/tit.2005.858979

Google Scholar

[2] E. J. Candes. The restricted isometry property and its implications for compressed sensing: Comptes Rendus Mathematique. Vol. 346 (2008), p.589–592.

DOI: 10.1016/j.crma.2008.03.014

Google Scholar

[3] X. Han and H. Zhang. Research of sparse recovery algorithm based on model noise. Journal of Electronics & Information Technology. Vol. 34 (2012), pp.1813-1818.

DOI: 10.3724/sp.j.1146.2011.01234

Google Scholar

[4] D. Malioutov, M. Cetin, and A. S. Willsky. A sparse signal reconstruction perspective for source localization with sensor arrays. IEEE Trans. Signal Process. Vol. 53 (2005), p.3010–3022.

DOI: 10.1109/tsp.2005.850882

Google Scholar

[5] Harry L. Van Trees: Detection, Estimation, and Modulation Theory, Partly Ⅳ, Optimum Array Processing (New York: Wiley, 2002).

Google Scholar