A Generalized Approach for Recovering Time Encoded Signals With Finite Rate of Innovation

In this paper, we consider the problem of reconstructing a function <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) from its direct time encoding machine (TEM) measurements in a general scenario in which the signal is represented as an infinite sum of weighted generic functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) shifted in real time points. These functions belong to the class of signals with finite rate of innovation (FRI), which is more general than shift-invariant or bandlimited spaces, for which recovery guarantees were already introduced. For an FRI signal <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>), recovery guarantees from their direct TEM samples were introduced for particular functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) or functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) with alias cancellation properties leading to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) being periodic and bandlimited. On the theoretical front, this work significantly increases the class of functions for which reconstruction is guaranteed, and provide a condition for perfect input recovery depending on the first two local derivatives of ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>). We extend this result with reconstruction guarantees in the case of noise corrupted FRI signals. On the practical front, we validate the proposed method via numerical simulations with filters previously used in the literature, as well as filters that are not compatible with the existing results. In cases where the filter has an unknown mathematical function and is only measured, the proposed method streamlines the recovery process by bypassing the filter modelling stage. Additionally, we validate the proposed method using a TEM hardware implementation.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal Processing
Published
2025-01-01
DOI
https://doi.org/10.1109/tsp.2025.3567443
Citations
2
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
2.67

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Generalized Approach for Recovering Time Encoded Signals With Finite Rate of Innovation

Dorian Florescu
2 citations
IEEE Transactions on Signal Processing
Sparse and Compressive Sensing Techniques
2.67
article

A Generalized Approach for Recovering Time Encoded Signals With Finite Rate of Innovation

Dorian Florescu
article en
2 citations

Abstract

In this paper, we consider the problem of reconstructing a function <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) from its direct time encoding machine (TEM) measurements in a general scenario in which the signal is represented as an infinite sum of weighted generic functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) shifted in real time points. These functions belong to the class of signals with finite rate of innovation (FRI), which is more general than shift-invariant or bandlimited spaces, for which recovery guarantees were already introduced. For an FRI signal <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>), recovery guarantees from their direct TEM samples were introduced for particular functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) or functions ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) with alias cancellation properties leading to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">g</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>) being periodic and bandlimited. On the theoretical front, this work significantly increases the class of functions for which reconstruction is guaranteed, and provide a condition for perfect input recovery depending on the first two local derivatives of ϕ(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>). We extend this result with reconstruction guarantees in the case of noise corrupted FRI signals. On the practical front, we validate the proposed method via numerical simulations with filters previously used in the literature, as well as filters that are not compatible with the existing results. In cases where the filter has an unknown mathematical function and is only measured, the proposed method streamlines the recovery process by bypassing the filter modelling stage. Additionally, we validate the proposed method using a TEM hardware implementation.

IEEE Transactions on Signal ProcessingVol. 73
University of Bath (GB)
UK Research and Innovation, Medical Research Council
Industry, innovation and infrastructure
Openalex Percentile: Top 12%
Sparse and Compressive Sensing Techniques
2.67
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.