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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information Theory: 2000 IEEE International Symposium On s. 298
Hlavní autoři: En-Hui Yang, Kaltchenko, A., Kieffer, J.C.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 2000
Témata:
Arithmetic
Chromium
Data compression
Decoding
Entropy
USA Councils
ISBN:9780780358577, 0780358570
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9780780358577
0780358570
DOI:10.1109/ISIT.2000.866596