# Recovery of the starting times of delayed signals

**Authors:** Luca Perotti, Daniel Vrinceanu, Daniel Bessis

arXiv: 1703.07001 · 2018-10-17

## TL;DR

This paper introduces a novel iterative method for accurately identifying the starting times of multiple delayed signals within finite data sequences, even under noisy conditions.

## Contribution

The paper proposes a new iterative approach to locate the starting points of multiple delayed signals, including damped ones, in finite data sequences, with demonstrated noise robustness.

## Key findings

- Effective in locating the longest delay first
- Iterative method successfully identifies all starting points
- Noise sensitivity tests show robustness under weak noise

## Abstract

We present a new method to locate the starting points in time of an arbitrary number of (damped) delayed signals. For a finite data sequence, the method permits to first locate the starting point of the component with the longest delay, and then --by iteration-- all the preceding ones. Numerical examples are given and noise sensitivity is tested for weak noise.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.07001/full.md

## Figures

13 figures with captions in the complete paper: https://tomesphere.com/paper/1703.07001/full.md

## References

13 references — full list in the complete paper: https://tomesphere.com/paper/1703.07001/full.md

---
Source: https://tomesphere.com/paper/1703.07001