Title :
Switching between two universal source coding algorithms
Author :
Volf, Paul A J ; Willems, Frans M J
Author_Institution :
Inf. & Commun. Theory Sect., Eindhoven Univ. of Technol., Netherlands
fDate :
30 Mar-1 Apr 1998
Abstract :
This paper discusses a switching method which can be used to combine two sequential universal source coding algorithms. The switching method treats these two algorithms as black-boxes and can only use their estimates of the probability distributions for the consecutive symbols of the source sequence. Three weighting algorithms based on this switching method are presented. Empirical results show that all three weighting algorithms give a performance better than the performance of the source coding algorithms they combine
Keywords :
adaptive systems; arithmetic codes; computational complexity; probability; sequences; source coding; arithmetic encoder; data compression algorithms; fast adaptive solution; performance; probability distributions; reduced complexity algorithm; sequential universal source coding algorithms; snake algorithm; source sequence; switching method; weighting algorithms; Algorithm design and analysis; Arithmetic; Communication switching; Data compression; Decoding; Performance loss; Probability distribution; Source coding;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672217