Adaptive vector K-tree partitioning an entropy coder: application to ECG compression
by Supriya O. Rajankar; Sanjay N. Talbar
International Journal of Telemedicine and Clinical Practices (IJTMCP), Vol. 2, No. 3, 2017

Abstract: The traditional run length coding method is beneficial only in the case of long runs of ones or zeros in the bitstream. There is a need for an alternate encoding method that can achieve compression even if there are frequent changes in the bitstream. This paper presents a new one-dimensional coder named adaptive vector K-tree partitioning (AVKTP). The method emphasises on encoding the binary significance map in a depth-first search manner, also makes the length of sub-vectors bitstream adaptive. The application to ECG compression shows that AVKTP provides higher compression than RLE and VKTP coder retaining the signal quality. The optimum length of sub-vector achieves improved compression. Depth first search method facilitates the encoding and post compression quality control.

Online publication date: Mon, 06-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Telemedicine and Clinical Practices (IJTMCP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com