On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet

Abstract

SUMMARYAn antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary alphabet. This paper proposes on-line ECG lossless compression for a given data on a finite alphabet. The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do. Moreover, the proposed algorithm work in real-time. Its effectiveness is demonstrated by simulation results.

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets

“…As yet another application of our O(n)-time DAWG construction algorithm, we present an optimal time algorithm to compute minimal absent words for a given string. There are a number of applications to minimal absent words, including data compression [16,17] and molecular biology [18,19,20,21,22,23,24]. Hence, it is important to develop efficient algorithms for computing minimal absent words from a given string.…”

A Highly Adaptive Lossless ECG Compression ASIC for Wireless Sensors Based on Hybrid Gomlomb Coding

“…Lossless ECG compression is therefore more preferred. Although software-based methods [3], [4] gain high compression performance, they require complicated training and computing that might result in high resource overhead and power consumption. Lots of works [5]- [8] have been presented to perform lossless ECG compression that can be efficiently implemented in hardware.…”

Length of minimal forbidden words on a stationary ergodic source

“…The set of all MFWs for a given string is called antidictionary, and the antidictionary is in particular useful for data compression (cf. [1]- [8]). The first application of antidictionaries to data compression for a binary string was proposed by Crochemore et at.…”