In order to apply the arithmetic coding for multi-level Markov-model sources, most conventional methods were using binary arithmetic codes by decomposing multi-level Markov-model sources into plural binary sources, which we here call B-B coding. The advantages of B-B coding are the possibility of utilizing the study results of binary arithmetic codes but it may need longer time by the increase of coding/decoding the expanded binary sources. The usage of multi-alphabet arithmetic code to multi-level Markov-model sources, which will be called as M-M coding here, and the comparison with B-B coding will be very interesting but it has been impossible since there are almost no report concerning the practical multi-alphabet arithmetic coding. In this paper, we will try to propose the basic design and the practical guideline of multiplication-free multi-alphabet arithmetic code (MFMAC) which will make the comparison of the total performance of B-B coding and M-M coding, possible. The basic design of MFMAC is composed of model source assumption, symbol area determination rule, designing of model parameter set for static coding, model parameter estimation for dynamic coding, and symbol ranking detection and update. We will also evaluate its performance of MFMAC, based on a design example. As there are many types of multi-level Markov-model sources, the general comparison of B-B coding and M-M coding will be left for individual cases, in which specific coding specification will be determined based on this designing guideline.
抄録全体を表示