Share Email Print
cover

Proceedings Paper

Ultraspectral sounder data compression using the non-exhaustive Tunstall coding
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

With its bulky volume, the ultraspectral sounder data might still suffer a few bits of error after channel coding. Therefore it is beneficial to incorporate some mechanism in source coding for error containment. The Tunstall code is a variable-to- fixed length code which can reduce the error propagation encountered in fixed-to-variable length codes like Huffman and arithmetic codes. The original Tunstall code uses an exhaustive parse tree where internal nodes extend every symbol in branching. It might result in assignment of precious codewords to less probable parse strings. Based on an infinitely extended parse tree, a modified Tunstall code is proposed which grows an optimal non-exhaustive parse tree by assigning the complete codewords only to top probability nodes in the infinite tree. Comparison will be made among the original exhaustive Tunstall code, our modified non-exhaustive Tunstall code, the CCSDS Rice code, and JPEG-2000 in terms of compression ratio and percent error rate using the ultraspectral sounder data.

Paper Details

Date Published: 5 September 2008
PDF: 9 pages
Proc. SPIE 7084, Satellite Data Compression, Communication, and Processing IV, 708406 (5 September 2008); doi: 10.1117/12.795810
Show Author Affiliations
Shih-Chieh Wei, Tamkang Univ. (Taiwan)
Bormin Huang, Univ. of Wisconsin, Madison (United States)


Published in SPIE Proceedings Vol. 7084:
Satellite Data Compression, Communication, and Processing IV
Bormin Huang; Roger W. Heymann; Joan Serra-Sagristà, Editor(s)

© SPIE. Terms of Use
Back to Top