Recovery of the starting times of delayed signals

Luca Camillo Perotti; Daniel Vrinceanu; Daniel Bessis

Recovery of the starting times of delayed signals

Luca Camillo Perotti, Daniel Vrinceanu, Daniel Bessis

Thurgood Marshall School of Law

Texas Southern University

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	Default journal
State	Published - Oct 1 2018

Keywords

Data analysis
delayed signals
Padé approximant
U-transform

Access to Document

https://doi.org/10.1109/LSP.2018.2864194

Cite this

@article{679b5f1350b34c7093824b2b8c86f724,

title = "Recovery of the starting times of delayed signals",

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.",

keywords = "Data analysis, delayed signals, Pad{\'e} approximant, U-transform",

author = "Perotti, \{Luca Camillo\} and Daniel Vrinceanu and Daniel Bessis",

year = "2018",

month = oct,

day = "1",

language = "American English",

journal = "Default journal",

}

TY - JOUR

T1 - Recovery of the starting times of delayed signals

AU - Perotti, Luca Camillo

AU - Vrinceanu, Daniel

AU - Bessis, Daniel

PY - 2018/10/1

Y1 - 2018/10/1

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

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

KW - Data analysis

KW - delayed signals

KW - Padé approximant

KW - U-transform

UR - https://digitalscholarship.tsu.edu/facpubs/143

UR - https://doi.org/10.1109/LSP.2018.2864194

M3 - Article

JO - Default journal

JF - Default journal

ER -

Recovery of the starting times of delayed signals

Abstract

Keywords

Access to Document

Other files and links

Cite this