Abstract
The basic theories of compressed sensing and measurement matrix are reviewed firstly, and then the equivalent conditions of the Null Space Property and Restricted Isometry Property for measurement matrix, the incoherence is introduced, including the theory and mathematical proof. On this basis, the construction methods and properties of several commonly used measurement matrices (random Gaussian matrix, Bernoulli random matrix, and Toeplitz matrix) are introduced. The time-domain sparse signals are used for simulation analysis. Simulation results show that the sparse signals can reconstructed when the measurement dimension M satisfies certain conditions. Considering the hardware implementation and storage space for matrix, and with the idea of circular matrix, this paper proposes a pseudo-random Bernoulli matrix. The simulation results show that the proposed matrix can realize reconstruction of sparse signal and is hardware-friendly, moreover, the required storage space is small.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hajela D (1990) On computing the minimum distance for faster-than-Nyquist signaling. IEEE Trans Inf Theory 36(2):289–295
Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289–1306
Baraniuk RG (2007) Compressive sensing [lecture notes]. Sig Process Mag IEEE 24:118–121
Candes EJ, Romberg J (2006) Quantitative robust uncertainty principles and optimally sparse decompositions. Found Comput Math 6:227–254
Candès EJ, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. Inf Theory, IEEE Trans On 52:489–509
Candes EJ, Romberg JK, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math 59:1207–1223
Candes EJ, Tao T (2006) Near-optimal signal recovery from random projections: universal encoding strategies. IEEE Trans Inf Theory 52:5406–5425
Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best k-term approximation. J Amer Math Soc 22:211–231
Candès EJ (2006) Compressive sampling. In: Proceedings of the international congress of mathematicians. pp 1433–1452
Sha W (2008) Introduction to compression sensing, University of Hong Kong
Donoho DL, Huo X (2001) Uncertainty principles and ideal atomic decomposition. IEEE Trans Inf Theory 47(7):2845–2862
Baraniuk R, Davenport M, DeVore R et al (2008) A simple proof of the restricted isometry property for random matrices. Constr Approx 28:253–263
Christensen O (2003) An introduction to frames and riesz bases. Birkhauser, Boston, Denmark
Wojtaszczyk P (2010) Stability and instance optimality for gaussian measurements in compressed sensing. Found Comput Math 10:1–13
Tropp J, Gilbert A (2007) Signal recovery from random measurements via orthogonal matching pursuit. Trans Inf Theory 53(12):4655–4666
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, Z., Wang, H., Sun, G., Xu, Y. (2020). Research on Measurement Matrix Based on Compressed Sensing Theory. In: Liang, Q., Wang, W., Liu, X., Na, Z., Jia, M., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2019. Lecture Notes in Electrical Engineering, vol 571. Springer, Singapore. https://doi.org/10.1007/978-981-13-9409-6_261
Download citation
DOI: https://doi.org/10.1007/978-981-13-9409-6_261
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-9408-9
Online ISBN: 978-981-13-9409-6
eBook Packages: EngineeringEngineering (R0)