Extensive Markov system for ECG exact coding

Research output: Contribution to journalArticle

Abstract

In this paper an extensive Markov process, which considers both the coding redundancy and the intersample redundancy, is presented to measure the entropy value of an ECG signal more accurately. It utilizes the intersample correlations by predicting the incoming n samples based on the previous m samples which constitute an extensive Markov process state. Theories of the extensive Markov process and conventional n repeated applications of m-th order Markov process are studied first in this paper. After that, they are realized for ECG exact coding. Results show that a better performance can be achieved by our system. The average code length for the extensive Markov system on the second difference signals was 2.512 bits/sample, while the average Huffman code length for the second difference signal was 3.326 bits/sample.

Original languageEnglish
Number of pages1
JournalData Compression Conference Proceedings
Publication statusPublished - 1995

Fingerprint

Electrocardiography
Markov processes
Redundancy
Entropy

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

@article{2d5fccf459ff4a3489ff954ab0395c86,
title = "Extensive Markov system for ECG exact coding",
abstract = "In this paper an extensive Markov process, which considers both the coding redundancy and the intersample redundancy, is presented to measure the entropy value of an ECG signal more accurately. It utilizes the intersample correlations by predicting the incoming n samples based on the previous m samples which constitute an extensive Markov process state. Theories of the extensive Markov process and conventional n repeated applications of m-th order Markov process are studied first in this paper. After that, they are realized for ECG exact coding. Results show that a better performance can be achieved by our system. The average code length for the extensive Markov system on the second difference signals was 2.512 bits/sample, while the average Huffman code length for the second difference signal was 3.326 bits/sample.",
author = "Shen-Chuan Tai",
year = "1995",
language = "English",
journal = "Proceedings of the Data Compression Conference",
issn = "1068-0314",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Extensive Markov system for ECG exact coding. / Tai, Shen-Chuan.

In: Data Compression Conference Proceedings, 1995.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Extensive Markov system for ECG exact coding

AU - Tai, Shen-Chuan

PY - 1995

Y1 - 1995

N2 - In this paper an extensive Markov process, which considers both the coding redundancy and the intersample redundancy, is presented to measure the entropy value of an ECG signal more accurately. It utilizes the intersample correlations by predicting the incoming n samples based on the previous m samples which constitute an extensive Markov process state. Theories of the extensive Markov process and conventional n repeated applications of m-th order Markov process are studied first in this paper. After that, they are realized for ECG exact coding. Results show that a better performance can be achieved by our system. The average code length for the extensive Markov system on the second difference signals was 2.512 bits/sample, while the average Huffman code length for the second difference signal was 3.326 bits/sample.

AB - In this paper an extensive Markov process, which considers both the coding redundancy and the intersample redundancy, is presented to measure the entropy value of an ECG signal more accurately. It utilizes the intersample correlations by predicting the incoming n samples based on the previous m samples which constitute an extensive Markov process state. Theories of the extensive Markov process and conventional n repeated applications of m-th order Markov process are studied first in this paper. After that, they are realized for ECG exact coding. Results show that a better performance can be achieved by our system. The average code length for the extensive Markov system on the second difference signals was 2.512 bits/sample, while the average Huffman code length for the second difference signal was 3.326 bits/sample.

UR - http://www.scopus.com/inward/record.url?scp=0029235489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029235489&partnerID=8YFLogxK

M3 - Article

JO - Proceedings of the Data Compression Conference

JF - Proceedings of the Data Compression Conference

SN - 1068-0314

ER -