A computationally efficient algorithm for online spectral analysis of beat-to-beat signals

Paolo Castiglioni; M. Di Rienzo; H. Yosh

A computationally efficient algorithm for online spectral analysis of beat-to-beat signals

Paolo Castiglioni, M. Di Rienzo, H. Yosh

Fondazione Don Carlo Gnocchi Onlus

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A new algorithm is proposed for the online Fourier analysis of unevenly sampled data. The method is based on the theoretical evaluation of the Fourier Transform of a function linearly interpolating the data, and does not require actual interpolation and re-sampling. The method is particularly suitable for the running evaluation of power spectra. In fact, when a new sample is available, the spectrum can be updated simply by performing calculations on the last sample, without the need to calculate the Fourier Transform again over the whole data record. Applications with simulated and real data show the capability of the algorithm to efficiently estimate the Fourier transform of unevenly sampled cardiovascular data, beat after beat.

Original language	English
Title of host publication	Computers in Cardiology
Editors	A. Murray
Pages	417-420
Number of pages	4
Volume	29
Publication status	Published - 2002
Event	Computers in Cardiology 2002 - Memphis, TN, United States Duration: Sep 22 2002 → Sep 25 2002

Other

Other	Computers in Cardiology 2002
Country	United States
City	Memphis, TN
Period	9/22/02 → 9/25/02

ASJC Scopus subject areas

Software
Cardiology and Cardiovascular Medicine

Fingerprint Dive into the research topics of 'A computationally efficient algorithm for online spectral analysis of beat-to-beat signals'. Together they form a unique fingerprint.

Cite this

@inproceedings{30f21901424843dd9d47579c88e18267,

title = "A computationally efficient algorithm for online spectral analysis of beat-to-beat signals",

abstract = "A new algorithm is proposed for the online Fourier analysis of unevenly sampled data. The method is based on the theoretical evaluation of the Fourier Transform of a function linearly interpolating the data, and does not require actual interpolation and re-sampling. The method is particularly suitable for the running evaluation of power spectra. In fact, when a new sample is available, the spectrum can be updated simply by performing calculations on the last sample, without the need to calculate the Fourier Transform again over the whole data record. Applications with simulated and real data show the capability of the algorithm to efficiently estimate the Fourier transform of unevenly sampled cardiovascular data, beat after beat.",

author = "Paolo Castiglioni and {Di Rienzo}, M. and H. Yosh",

year = "2002",

language = "English",

volume = "29",

pages = "417--420",

editor = "A. Murray",

booktitle = "Computers in Cardiology",

note = "Computers in Cardiology 2002 ; Conference date: 22-09-2002 Through 25-09-2002",

}

TY - GEN

T1 - A computationally efficient algorithm for online spectral analysis of beat-to-beat signals

AU - Castiglioni, Paolo

AU - Di Rienzo, M.

AU - Yosh, H.

PY - 2002

Y1 - 2002

N2 - A new algorithm is proposed for the online Fourier analysis of unevenly sampled data. The method is based on the theoretical evaluation of the Fourier Transform of a function linearly interpolating the data, and does not require actual interpolation and re-sampling. The method is particularly suitable for the running evaluation of power spectra. In fact, when a new sample is available, the spectrum can be updated simply by performing calculations on the last sample, without the need to calculate the Fourier Transform again over the whole data record. Applications with simulated and real data show the capability of the algorithm to efficiently estimate the Fourier transform of unevenly sampled cardiovascular data, beat after beat.

AB - A new algorithm is proposed for the online Fourier analysis of unevenly sampled data. The method is based on the theoretical evaluation of the Fourier Transform of a function linearly interpolating the data, and does not require actual interpolation and re-sampling. The method is particularly suitable for the running evaluation of power spectra. In fact, when a new sample is available, the spectrum can be updated simply by performing calculations on the last sample, without the need to calculate the Fourier Transform again over the whole data record. Applications with simulated and real data show the capability of the algorithm to efficiently estimate the Fourier transform of unevenly sampled cardiovascular data, beat after beat.

UR - http://www.scopus.com/inward/record.url?scp=0036945502&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036945502&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036945502

VL - 29

SP - 417

EP - 420

BT - Computers in Cardiology

A2 - Murray, A.

T2 - Computers in Cardiology 2002

Y2 - 22 September 2002 through 25 September 2002

ER -