Title: Adaptive vector K-tree partitioning an entropy coder: application to ECG compression

Authors: Supriya O. Rajankar; Sanjay N. Talbar

Addresses: Sinhgad College of Engineering, Pune 411041, India ' Shri Guru Gobind Singhji Institute of Engineering and Technology, Nanded 431606, India

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.

Keywords: ECG compression; SPIHT; vector K-tree partitioning; VKTP; adaptive vector K-tree partitioning; AVKTP; RLE.

DOI: 10.1504/IJTMCP.2017.087873

International Journal of Telemedicine and Clinical Practices, 2017 Vol.2 No.3, pp.215 - 224

Received: 09 May 2016
Accepted: 22 Nov 2016

Published online: 06 Nov 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article