DocumentCode :
1710117
Title :
On improving the PPM algorithm
Author :
Korodi, Gergely ; Tabus, Ioan
Author_Institution :
Dept. of Signal Process., Tampere Univ. of Technol., Tampere
fYear :
2008
Firstpage :
1450
Lastpage :
1453
Abstract :
In this paper we analyze the Prediction by Partial Match algorithm as the aggregate of several functions operating on a context tree data structure. We describe some of the serious weaknesses of the original method, and propose new directions to improve compression efficiency.
Keywords :
data compression; prediction theory; tree data structures; PPM algorithm; compression efficiency; prediction by partial match algorithm; tree data structure; Aggregates; Algorithm design and analysis; Compression algorithms; Context modeling; Counting circuits; Predictive models; Runtime; Signal processing algorithms; Switches; Tree data structures;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Control and Signal Processing, 2008. ISCCSP 2008. 3rd International Symposium on
Conference_Location :
St Julians
Print_ISBN :
978-1-4244-1687-5
Electronic_ISBN :
978-1-4244-1688-2
Type :
conf
DOI :
10.1109/ISCCSP.2008.4537455
Filename :
4537455
Link To Document :
بازگشت