EventsThe 1st Online Conference on Algorithms
Published
This submission belongs to the session G. Algorithms for Multidisciplinary Applications of the event The 1st Online Conference on Algorithms
Published date
26 Sep, 2021
Academic Editor
author-avatarFrank Werner
Citation
Janith Kodithuwakku, Dilki Dandeniya Arachchi, Saw Thiha, Jay Rajasekara, Two Optimized IoT Device Architectures Based on Fast Fourier Transform to Monitor Patient’s Photoplethysmography and Body Temperature, in Proceedings of The 1st Online Conference on Algorithms, 27 September–10 October 2021, MDPI: Basel, Switzerland, doi: 10.3390/IOCA2021-10905
Share
Email
Facebook
Twitter
LinkedIn

Two Optimized IoT Device Architectures Based on Fast Fourier Transform to Monitor Patient’s Photoplethysmography and Body Temperature

image
image
Saw Thiha 2
image
1. Tokyo International University
2. Tokyo International University
Abstract

The measurement of Blood-Oxygen Saturation, Heart Rate, and Body Temperature are very prominent in monitoring patients. Photoplethysmography(PPG) is an optical method that can be used to measure Heart Rate, Blood-Oxygen Saturation, and many analytic about Cardiovascular Health of a patient by analyzing the waveform. With the COVID-19 pandemic, there is a high demand for a product that can remotely monitor such parameters of a COVID patient. This paper proposes two major design architectures for the product with optimized system implementations by utilizing the ESP32 development environment and cloud computing. In one method it discusses edge computing with the Fast Fourier Transform(FFT) algorithm to extract features from the waveform before transferring to the cloud while the other method transfers raw sensor values to the cloud without any loss of information. This paper especially compares the performance of both system architectures with respect to bandwidth, sampling frequency, and loss of information.

Keywords
Photoplethysmography(PPG)
Fast Fourier Transform(FFT)
Internet of Things(IoT)
Manuscript
Maximum Multi-Commodity Flow with Proportional and Flow-dependent Capacity Sharing
Enumerative Algorithm for finding minimum dominating set in a graph.