Abstract
The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient coding scheme widely used in wavelet-based electrocardiography (ECG) data compression systems. Traditional SPIHT schemes using three lists and a complex sorting process are unsuitable for wearable device design due to their time-consuming nature and low storage efficiency. In this paper, based on a bit-plane representation of quantized wavelet coefficients, a modified SPIHT algorithm is proposed for fast lossless coding. The bit plane is first represented by a tree data structure consisting of two types of primitive trees. The number of primitives is relative to the number of input sampled data. The coding process of the bit-plane data can be regarded as a synthesis that assembles the primitives sequentially based on various decision rules. The assembly rules are further simplified into logic-level decisions in terms of a flag scheme. Using the MIT-BIH arrhythmia database, the experimental results show that the proposed algorithm can achieve an up to 64.35% coding time reduction in comparison with the traditional SPIHT algorithm at a cost of a 0.28% bit-rate increase. The proposed algorithm is simple, regular, and modular.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
