Abstract
This paper investigates the problem of recovering a binary-valued signal from compressed measurements of its convolution with a known finite impulse response filter. We show that it is possible to attain optimum sample complexity for exact recovery (in absence of noise) with a computationally efficient algorithm. We achieve this by adopting an algorithm-measurement co-design strategy where the measurement matrix is designed as a function of the filter, such that the recovery of binary signals with arbitrary sparsity is possible by using a sequential decoding algorithm. Such a filter-dependent sampler design can overcome the computational challenges associated with enforcing binary constraints, and enable us to operate in “extreme compression” regimes, where the number of measurements can be much smaller than the sparsity level.
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.
