Abstract
Compressed sensing (CS) is a new data acquisition theory taking full use of the sparsity of signals. It reveals that higher-dimensional sparse signals can be reconstructed from fewer nonadaptive linear measurements. The construction of CS matrices in CS is the key problem. In this paper, the deterministic CS matrices from optimal codebooks are constructed. Furthermore, the maximum sparsity of recovering the sparse signals by using our CS matrices are obtained. Meanwhile, a comparison is made with the CS matrices constructed by DeVore based on polynomials over finite fields. In the numerical simulations, our CS matrix outperforms DeVore[Formula: see text]s matrix in the process of recovering sparse signals.
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.
