Paper
31 August 2009 Study of the codeword assignment for a revised Tunstall code
Author Affiliations +
Abstract
By using fixed-length codewords and not using an adaptive dictionary, the Tunstall coding stands out as an errorresilient lossless compression technique. Our previous work has shown that use of the non-exhaustive parse tree can improve the compression ratio of the Tunstall coding without compromising its error resilience. As change of codeword assignment will only affect the error propagation, not the compression ratio, we experimented in this work the various codeword assignment methods to minimize the error propagation of our revised Tunstall coding. The result shows that the breadth first assignment of codewords to the Tunstall parse tree gives the lowest percent error rate. Also the linear prediction followed by non-exhaustive Tunstall parse tree, and the alignment marker (LP+Tunstall non-exhaustive) has the best performance in terms of compression ratio and percent error rate when compared to other LP+Bitcut+Tunstall methods, JPEG-2000 and CCSDS Rice coding schemes.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shih-Chieh Wei and Bormin Huang "Study of the codeword assignment for a revised Tunstall code", Proc. SPIE 7455, Satellite Data Compression, Communication, and Processing V, 74550L (31 August 2009); https://doi.org/10.1117/12.826822
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Chromium

Algorithms

Error analysis

Associative arrays

Computer programming

Data compression

Head

Back to Top