2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDSPTM-17.5
Paper Title NO RELAXATION: GUARANTEED RECOVERY OF FINITE-VALUED SIGNALS FROM UNDERSAMPLED MEASUREMENTS
Authors Pulak Sarangi, Piya Pal, University of California, San Diego, United States
SessionSPTM-17: Sampling, Multirate Signal Processing and Digital Signal Processing 3
LocationGather.Town
Session Time:Thursday, 10 June, 15:30 - 16:15
Presentation Time:Thursday, 10 June, 15:30 - 16:15
Presentation Poster
Topic Signal Processing Theory and Methods: [SMDSP-SAP] Sparsity-aware Processing
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract This paper considers the problem of recovering a unipolar finite-valued signal from compressive measurements of its convolution with a known finite impulse response filter. We show that owing to the finite-value constraint the problem remains identifiable if the downsampling factor is smaller than the filter length. We develop a new computationally efficient decoding algorithm that can operate at the optimal downsampling factor under mild conditions on the filter. This allows us to explicitly impose the finite value constraint (no relaxation) without compromising on the computational tractability.