基于波形转换的算法在FPGA中实现心率和RT间隔的实时自动测量:在长期门诊心电图监视器中的应用
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
概括
这项研究开发了一个使用FPGA技术进行实时心率和RT间隔测量的低功率门诊心电图监测器. 该系统准确检测心脏异常,有助于评估心血管疾病.
科学领域:
- 生物医学工程 生物医学工程
- 心脏病学 心脏病学
- 数字信号处理 数字信号处理
背景情况:
- 心血管疾病是全球主要的死亡原因,需要先进的监测解决方案.
- 带有自动间隔测量的非侵入性门诊心电图 (ECG) 监视器对于诊断心脏病状况至关重要.
研究的目的:
- 实施基于FPGA的算法,用于节拍心率和RT间隔测量.
- 开发一个实时心脏分析的原型门诊心电图监测器.
主要方法:
- 使用连续波束转换 (CWT) 带有 QRS 复合体和 T 波端检测的线条.
- 集成了一个ADS1294模拟数字转换器和Xilinx Artix-7 FPGA用于信号采集和处理.
- 实现了有限脉冲响应 (FIR) 过器,用于信号调节.
主要成果:
- FPGA算法成功地在实时检测到各种QRS复杂和T波形态.
- 取得了令人满意的心率和RT间隔的节拍测量.
- 原型展示了有效的数据存储在micro-SD和显示在液晶显示器上.
结论:
- 开发的基于FPGA的算法为门诊心电图监测提供了强大的解决方案.
- 这项技术可以实时分析心率和RT间隔动态,以改善心脏病患者的评估.
相关概念视频
Pulse rhythm
826
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...
Conversely, an irregular pulse pattern is termed dysrhythmia, stemming from disruptions in cardiac...
826
Holter Monitor: 24-Hour Monitoring
41
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 Transform
368
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
368


