Uniqueness and Robustness of Tem-Based FRI Sampling

  • Hila Naaman
  • , Satish Mulleti
  • , Yonina C. Eldar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper, we study the problem of sampling finite-rate-of-innovation (FRI) signals by using an integrate-and-fire time encoding machine. We consider a Fourier-domain reconstruction approach and design a robust sampling kernel that has a frequency-domain alias cancellation condition and excludes the zero frequency. In the absence of noise, we present theoretical recovery guarantees for FRI signals with arbitrary pulse shapes using our approach. We show that the minimum firing rate is proportional to the rate of innovation of the FRI signal. In the presence of noise, our technique results in 2-10 dB lower error while estimating the FRI parameters compared to existing methods for the same number of measurements.

Original languageEnglish
Title of host publication2022 IEEE International Symposium on Information Theory, ISIT 2022
PublisherInstitute of Electrical and Electronics Engineers
Pages2631-2636
Number of pages6
ISBN (Electronic)9781665421591
DOIs
StatePublished - 1 Jan 2022
Externally publishedYes
Event2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland
Duration: 26 Jun 20221 Jul 2022

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2022-June
ISSN (Print)2157-8095

Conference

Conference2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/TerritoryFinland
CityEspoo
Period26/06/221/07/22

Keywords

  • Time-encoding machine
  • finite-rate-of-innovation signals
  • integrate-and-fire
  • time-based sampling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Uniqueness and Robustness of Tem-Based FRI Sampling'. Together they form a unique fingerprint.

Cite this