On the estimation of T-wave alternans using the spectral fast fourier transform method

Antonis A Armoundas1, Theofanie Mela, Faisal M Merchant

  • 1Cardiovascular Research Center, Division of Cardiology, Massachusetts General Hospital, Harvard Medical School, Boston, Massachusetts 02129, USA. aarmoundas@partners.org

Heart Rhythm
|October 18, 2011
PubMed
Abstract

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
Dysrhythmias III: Characteristics of Dysrhythmias01:29

Dysrhythmias III: Characteristics of Dysrhythmias

Dysrhythmias, also known as arrhythmias, are irregular heart rhythms that result from abnormal electrical activity in the heart, affecting its ability to circulate blood efficiently. Tachyarrhythmias, a subset of dysrhythmias, are characterized by abnormally fast heart rates exceeding 100 beats per minute. Here are some types of tachyarrhythmias with their distinct ECG features:Sinus Tachycardia:Sinus tachycardia presents a regular heart rhythm with an increased rate of 101-180 beats per minute.
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Properties of Fourier Transform I01:21

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...