| 摘要 |
The number of times of processing to increment the number of reserved bits in arithmetic coding processing is reduced. For this purpose, upon inputting a binary symbol, a zone is divided into two zones at a ratio between occurrence probabilities of MPS and LPS, and one of the divided zones is selected according to the input symbol. When the length of the selected zone is shorter than a predetermined length, normalization is performed. Then it is determined whether or not a threshold for determining a decimal place of interest exists within the zone of interest. When the threshold exists within the zone of interest, the number of reserved bits is incremented by one. When the threshold exists without the zone, 1-bit data determined based on a relative position between the zone of interest and the threshold is outputted, bit data corresponding to the number of reserved bits is determined and outputted, and the number of reserved bits is cleared to zero.
|
