Recovery of the Starting Times of Delayed Signals

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 exa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2018-10, Vol.25 (10), p.1455-1459
Main Authors: Perotti, Luca Camillo, Vrinceanu, Daniel, Bessis, Daniel
Format: Article
Language:English
Subjects:
<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> {U}</tex-math> </inline-formula>-transform
Data analysis
delayed signals
Delays
Indexes
Iterative methods
Noise sensitivity
Oscillators
Padé approximant
Poles and zeros
Taylor series
Time-frequency analysis
Transient analysis
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2018.2864194