loading...
Low-Complexity Compression of Short Messages
Snowbird, Utah March 28-March 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.45Data Compression Conference (DCC'06)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Stephan Rein, Technical University of Berlin
Clemens Guhmann,, Technical University of Berlin
Frank H.P. Fitzek, Aalborg University
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of single symbols. Our particular contribution is a simple yet effective approach for storing highly complex statistics in a succinct yet effective data model that can easily be trained by text data. The proposed model already gives good compression rates with a RAM memory size of 128 kByte, thus making lossless data compression with statistical context modeling readily applicable to small devices like wireless sensors or mobile phones.
Citation:
Stephan Rein, Clemens Guhmann,, Frank H.P. Fitzek, "Low-Complexity Compression of Short Messages," dcc, pp.123-132, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.