Abstract
Abstract-Compressed Sensing (CS), a new area of signal processing, seeks to reconstruct sparse or compressible signal from a small number of measurements. Mostly, random matrix is used as measurement matrix, such as Gaussian, Bernoulli and Fourier matrices. However, those matrices are difficult to implement in hardware, so deterministic matrices are proposed, such as polynomial deterministic matrix. In this paper, we proposed blocked polynomial deterministic matrix, and proved that it satisfied the Restricted Isometry Property (RIP). Also, the proposed matrix has several advantages in CS applications: (i) The time of constructing matrix is shorter and the space to store the matrix is smaller compared with polynomial deterministic matrix; (ii) It can broaden the range of measurement number. Experimental results demonstrate that the proposed matrix is useful in CS applications.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
