Universal lossless data compression with side information by using a conditional MPM grammar transform

Author

Yang, En-Hui ; Kaltchenko, Alexei ; Kieffer, John C.

Author_Institution

Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada

fYear

2000

fDate

2000

Firstpage

298

Abstract

The MPM (multilevel pattern matching) grammar transform underlies a lossless data compression algorithm developed by Kieffer, Yang, Nelson and Cosman (see IEEE Trans. on Inform. Theory, 2000. In this paper, we extend the MPM grammar transform to the case of side information known to both the encoder and decoder, yielding a conditional MPM grammar transform which is referred to as the CMPM (r,I) transform. Based on the CMPM (r,I) transform, we develop a universal lossless data compression algorithm with side information called the CMPM algorithm, which has linear time and storage complexity and asymptotically achieves the conditional entropy rate of any stationary, ergodic source pair. The advantage of using side information, if any, for data compression is obvious; one can considerably reduce the compression rate if the side information is highly correlated with a sequence to be compressed

Keywords

arithmetic codes; data compression; decoding; entropy; grammars; pattern matching; transform coding; compression rate reduction; conditional MPM grammar transform; conditional arithmetic coding algorithms; conditional entropy rate; decoder; encoder; linear storage complexity; linear time complexity; multilevel pattern matching; optimality; side information; stationary ergodic source pair; universal lossless data compression algorithm; Arithmetic; Chromium; Data compression; Decoding; Entropy; USA Councils;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2000. Proceedings. IEEE International Symposium on

Conference_Location

Sorrento

Print_ISBN

0-7803-5857-0

Type

conf

DOI

10.1109/ISIT.2000.866596

Filename

866596