An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder

Pennebaker, William B.; Mitchell, J. L.; Langdon, Glen G.; Arps, Ronald B.

doi:10.1147/rd.326.0717

Cited by 305 publications

(115 citation statements)

References 14 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…In the basic algorithm outlined in Section 1 and in the work of Witten, Neal, and Cleary, u p t o t w o m ultiplications and one division are needed for each symbol encoded. Work by Rissanen, Langdon, Mohiuddin, and others at IBM 5,16,18,22,27 eliminates the division altogether and focuses on approximating the multiplication by combinations of additions and shifts. In 13 we present an alternative approach i n which w e approximate an arithmetic coder by a nite state automaton with a small number of states.…”

Section: Resultsmentioning

confidence: 99%

Analysis of arithmetic coding for data compression

Howard

Vitter

1992

Information Processing & Management

View full text Add to dashboard Cite

Arithmetic coding, in conjunction with a suitable probabilistic model, can provide nearly optimal data compression. In this article we analyze the e ect that the model and the particular implementation of arithmetic coding have on the code length obtained. Periodic scaling is often used in arithmetic coding implementations to reduce time and storage requirements; it also introduces a recency e ect which can further a ect compression. Our main contribution is introducing the concept of weighted entropy and using it to characterize in an elegant w a y the e ect that periodic scaling has on the code length. We explain why and by h o w m uch scaling increases the code length for les with a homogeneous distribution of symbols, and we c haracterize the reduction in code length due to scaling for les exhibiting locality of reference. We also give a rigorous proof that the coding e ects of rounding scaled weights, using integer arithmetic, and encoding end-of-le are negligible.

show abstract

Section: Resultsmentioning

confidence: 99%

Analysis of arithmetic coding for data compression

Howard

Vitter

1992

Information Processing & Management

View full text Add to dashboard Cite

show abstract

“…After parameter initializations, the system begins decoding the various Syntax Elements from the H.264 coded bitstream in the order as specified by the standard [5][6][7][8][9]. For "Skip" macroblock the system bypasses all decoding processes and begins decoding the next macroblock [10][11][12][13][14]. Once the decoding of all present syntax elements is completed for the required macroblock, this information is stored for future use as neighbor information.…”

Section: Context-based Arithmetic Coding (Cabac)mentioning

confidence: 99%

Performance evaluation of entropy coding for MPEG-4 video codec

Nigam¹,

Mishra²,

Diwakar³

2014

International Advanced Research Journal in Science, Engineering

View full text Add to dashboard Cite

This Paper deals with the Evaluation, Analysis and Algorithm of Context Adaptive Binary Arithmetic coding (CABAC) MPEG-4 Video Codec.MPEG-4 is an ISO/IEC video coding standard which supports highly interactive multimedia applications as well as traditional applications. It includes many advanced functionalities such as interactivities, scalabilities and error resilience. The growing popularity of MPEG-4 in the field of animation and interactive movies was the main motivation to include it in this work. This paper investigates the effect of CABAC Entropy coding scheme that is a crucial parameter for the performance of MPEG-4 video coder. In this paper Algorithm for Context Adaptive Binary Arithmetic coding (CABAC) is proposed for MPEG-4 Video Codec. The compression efficiency of CABAC is 8-12% better as compared to CAVLC and it can be up to 30% better when compared to other entropy compression methods.

show abstract

“…Very early, it was recognized that more attention should be paid to accelerating the coding path of the most probable symbol (mps) even at the expense of the least probably symbol (lps). The most important developments along this line have been the skew-coder [3], the Q-coder [4], and most recently the Z-coder [5]. However, even with fastest possible mps path, arithmetic coding remains an inherently serial task.…”

Section: Review Of Sparse Image Coding Techniquesmentioning

confidence: 99%

The skip-innovation model for sparse images

Usbeck¹

2000

Proceedings DCC 2000. Data Compression Conference

View full text Add to dashboard Cite

On sparse images, contiguous runs of identical symbols often occur in the same coding context. This paper proposes a model for efficiently encoding such runs in a twodimensional setting. Because it is model based, the method can be used with any coding scheme. An experimental coder using the model compresses the CCITT fax documents 2% better than JBIG and is more than three times as fast. A low complexity application of the model is shown to dramatically improve the compression performance of JPEG-LS on structured material.

show abstract

An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder

Cited by 305 publications

References 14 publications

Analysis of arithmetic coding for data compression

Analysis of arithmetic coding for data compression

Performance evaluation of entropy coding for MPEG-4 video codec

The skip-innovation model for sparse images

Contact Info

Product

Resources

About