Analysis on the codeword generating process of an arithmetic code and its application to source distribution transformer

点击翻译按钮获取中文摘要

Throughout this project, we have obtained the following results on the codeword generating process of an arithmetic code.2004-We evaluated theoretically, in the average sense, the redundancy included in a codeword generated by an arithmetic encoder. Moreover, we developed an algorithm to transform a sequence of information source symbols into another sequence with a given target distribution. This algorithm dissolve the following two practical problems that result from arithmetic codes:1) when the decoding process halt.2) how to reproduce exactly the original sequence from the transformed one.2005-We considered the encoding/decoding processes for an information source that outputs symbols with a random interval and studied on the number of code symbols, that is, a fragment of a codeword, that an arithmetic encoder outputs at a unit time and the interval that it outputs them. From computer experiments, the interval of fragments can be modeled by geometric distribution while the length of each fragment has a different one. We observed the similar results in the decoder side. That is, the arithmetic decoder outputs a fragment of a codeword with a geometric distribution on its interval. However, our experiments showed that the length of fragment is neither individual nor geometrically distributed. Finally, we investigate the delay of the coding process and evaluated the probability distribution of the delay for a memoryless binary source.