We analyze the expected delay for infinite precision arithmetic codes, and suggest a practical implementation that closely approximates the idealized infinite precision model.
We analyze the expected delay for infinite precision arithmetic codes, and suggest a practical implementation that closely approximates the idealized infinite precision model.
We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in 0(log n) time using n/log n processors. Each part of the algorithm as well as a well-known parallel pr...
详细信息
We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in 0(log n) time using n/log n processors. Each part of the algorithm as well as a well-known parallel prefix computation forming a basis of the algorithm are clarified on simple examples.
In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order...
详细信息
ISBN:
(纸本)9781424409969
In this paper we propose applying an adaptive context tree weighting method with a forbidden symbol in the H.264 coder. arithmetic codes with a forbidden symbol and a trellis search techniques are employed on an order to estimate the best transmitted codeword. Instead of using the context modeling defined in the H.264 standard, the arithmetic code with a forbidden symbol uses a CTW method. The CABAC algorithm is replaced by GRASP algorithm and the experimental results show that coding gains similar or superior to those obtained with the H.264/AVC CABAC algorithm and arithmetic coding.
Buffer or counter-based techniques are adequate for dealing with carry propagation in software implementations of arithmetic coding, but create problems in hardware implementations due to the difficulty of handling wo...
详细信息
ISBN:
(纸本)9781628415001
Buffer or counter-based techniques are adequate for dealing with carry propagation in software implementations of arithmetic coding, but create problems in hardware implementations due to the difficulty of handling worst-case scenarios, defined by very long propagations. We propose a new technique for constraining the carry propagation, similar to "bit-stuffing," but designed for encoders that generate data as bytes instead of individual bits, and is based on the fact that the encoder and decoder can maintain the same state, and both can identify the situations When it desired to limit carry propagation. The new technique adjusts the coding interval in a way that corresponds to coding an unused data symbol, but selected to minimize overhead. Our experimental results demonstrate that the loss in compression can be made very small using regular precision for arithmetic operations.
Software-based fault tolerance enables the usage of standard hardware in safety-critical applications. arithmetic coding is a promising approach for fault tolerance and is already used in the area of production system...
详细信息
ISBN:
(纸本)9781665400497
Software-based fault tolerance enables the usage of standard hardware in safety-critical applications. arithmetic coding is a promising approach for fault tolerance and is already used in the area of production systems. To enable the usage of complex safety functions, e.g. in human-robot collaboration, basic mathematical functions must be supported by the software-based fault-tolerance approach. Thereby, the basic mathematical functions require the full support of floating point values. Therefore, in this paper, we present a methodology to apply arithmetic coding on all types of floating-point functions including the basic mathematical functions. For each type, an example of implementation is shown. To validate our approach, we use the inverse kinematic of a cable robot as an example algorithm where the application of arithmetic coding is done automatically with a source-to-source transformation approach. Fault injection experiments validate the effectiveness of the presented approach.
To enable the usage of standard hardware in safety-critical applications for production systems, new approaches for hardware fault tolerance are required. These approaches must be implemented on software level. As sho...
详细信息
ISBN:
(纸本)9781728175348
To enable the usage of standard hardware in safety-critical applications for production systems, new approaches for hardware fault tolerance are required. These approaches must be implemented on software level. As shown in the literature, arithmetic coding is a promising approach, but only supports integer calculations. For complex safety functions, e.g. in robotics, fast floating-point calculations are needed. Therefore, this paper presents a method for direct arithmetic encoding of floating-point calculations with low-performance impact. Moreover, a detailed residual error estimation is given.
In this paper, we propose a new approach for block-based lossless image compression by defining a new semiparametric finite mixture model-based adaptive arithmetic coding. Conventional adaptive arithmetic encoders sta...
详细信息
In this paper, we propose a new approach for block-based lossless image compression by defining a new semiparametric finite mixture model-based adaptive arithmetic coding. Conventional adaptive arithmetic encoders start encoding a sequence of symbols with a uniform distribution, and they update the frequency of each symbol by incrementing its count after it has been encoded. When encoding an image row by row or block by block, conventional adaptive arithmetic encoders provide the same compression results. In addition, images are normally non-stationary signals, which means that different areas in an image have different probability distributions, so conventional adaptive arithmetic encoders which provide probabilities for the whole image are not very efficient. In the proposed compression scheme, an image is divided into non-overlapping blocks of pixels, which are separately encoded with an appropriate statistical model. Hence, instead of starting to encode each block with a uniform distribution, we propose to start with a probability distribution which is modeled by a semiparametric mixture obtained from the distributions of its neighboring blocks. The semiparametric model parameters are estimated through maximum likelihood using the expectation-maximization algorithm in order to maximize the arithmetic coding efficiency. The results of comparative experiments show that we provide significant improvements over conventional adaptive arithmetic encoders and the state-of-the-art lossless image compression standards.
arithmetic coding is a lossless data compression technology on a sequence of symbols in independent and identically distributed (i.i.d.) distributions. In this paper, we pointed out that the conventional arithmetic co...
详细信息
ISBN:
(纸本)9781728116693
arithmetic coding is a lossless data compression technology on a sequence of symbols in independent and identically distributed (i.i.d.) distributions. In this paper, we pointed out that the conventional arithmetic coding has the possibility of burst outputs between the encoder and the output buffer, and this brings up a number of potential risks. To solve this issue, we present a new arithmetic coding which encodes the output bitstream in reflected binary codes. The analysis shows that the proposed coding method can avoid the burst outputs during the encoding. The comparisons with Huffman codes, conventional arithmetic codes and Asymmetric numeral system are discussed. Simulations show that the proposed approach has better throughput performance than the conventional approach.
arithmetic coding gives lowest range of entropy for any string computed form joint probability value of sub-strings of keyword. It is very much permissible to use this technique for mapping a large set of keywords to ...
详细信息
ISBN:
(纸本)9781509030125
arithmetic coding gives lowest range of entropy for any string computed form joint probability value of sub-strings of keyword. It is very much permissible to use this technique for mapping a large set of keywords to real values with in the range of [0;1]. This will create a space of search containing tag value range for keywords and mapped all the keywords to this space. In this paper a new string approximation technique is proposed, which is based on the arithmetic coding used for mapping the misspelled keyword to the tag value interval in a limited search space containing the nearest possible keywords against the misspelled keyword. Using such technique time for searching all the nearest keywords is dramatically reduced due to reduction of search space.
We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effecti...
详细信息
ISBN:
(纸本)0819452114
We propose applying an adaptive context-tree weighting (CTW) method in the H.264 video coders. We first investigate two different ways to incorporating the CTW method into an H.264 coder and compare the coding effectiveness of using the method with that of using the context models specified in the H.264 standard. We then describe a novel approach for automatically adapting the CTW method based on the syntactic element to be coded and the encoding parameters. We show that our CTW-based arithmetic coding method yields similar or better compression results compared with the context-based adaptive arithmetic coding method used in H.264, without having to specify so many context models.
暂无评论