Implementation of Wavelet-Transform-Based Algorithms in an FPGA for Heart Rate and RT Interval Automatic Measurements

José Alberto García Limón1, Frank Martínez-Suárez1, Carlos Alvarado-Serrano1

  • 1Bioelectronics Section, Department of Electrical Engineering, Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional (CINVESTAV), Mexico City 07360, Mexico.

Micromachines
|September 28, 2023
PubMed
Summary

This study developed a low-power ambulatory ECG monitor using FPGA technology for real-time heart rate and RT interval measurements. The system accurately detects cardiac abnormalities, aiding in the evaluation of cardiovascular diseases.

Related Concept Videos

Pulse rhythm01:30

Pulse rhythm

Pulse rhythm refers to the pattern of pulsations within specific intervals, offering valuable insights into the regularity or irregularity of the heart's beats as observed through the pattern of pulsation within specific intervals. A regular pulse exhibits a consistent heart rate with uniform waveforms and pulsation force, variations of which can be classified as normal, weak, or bounding.
Conversely, an irregular pulse pattern is termed dysrhythmia, stemming from disruptions in cardiac...
826
Holter Monitor: 24-Hour Monitoring01:23

Holter Monitor: 24-Hour Monitoring

Holter monitoring is a continuous electrocardiography (ECG) recording that tracks the heart's electrical activity over an extended period, generally 24 to 48 hours. This noninvasive diagnostic tool detects irregular heart rhythms that may not be captured during a standard ECG performed in a clinical setting.DeviceThe Holter monitor is a portable, small device connected to several electrodes on the patient's chest. These electrodes detect the heart's electrical signals and transmit them to the...
41
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...
368