Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12188/30427
DC FieldValueLanguage
dc.contributor.authorGusev, Marjanen_US
dc.contributor.authorJovanov, Mileen_US
dc.contributor.authorShekerov, Aen_US
dc.contributor.authorTemelkov, Gen_US
dc.date.accessioned2024-06-06T07:58:53Z-
dc.date.available2024-06-06T07:58:53Z-
dc.date.issued2023-05-22-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/30427-
dc.description.abstractThis paper aims to reduce the amount of physical space the electrocardiogram data occupies and needs to be transferred, designing an efficient algorithm that can run on hardware commonly found in a medical device setting. The algorithm needs to be compatible with real-time data transfer and be fast and lossless. We introduce an algorithm inspired by pulse code modulation in telecommunication theory based on successive differences between neighboring electrocardiogram samples. The research hypothesis addressed in this paper finds if the new algorithm can reduce the data size by a meaningful amount and efficiently. Further on we tackle the research questions to find the level of distortion, compression, and processing speed of compression and decompression, along with the analysis of benefits and disadvantages. We reduced the storage space or bits to be transferred up to 46% reaching a compression ratio of 2.17 for an electrocardiogram benchmark dataset of up to 100 Mbits.en_US
dc.publisherIEEEen_US
dc.subjectECG , Sampling , Analog to digital conversion , ADC , Compression , Consecutive differencesen_US
dc.titleECG Compression Based on Successive Differencesen_US
dc.typeProceedingsen_US
dc.relation.conference2023 46th MIPRO ICT and Electronics Convention (MIPRO)en_US
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers
Show simple item record

Page view(s)

47
checked on May 3, 2025

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.