article · 2016

1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords

Senior Member

Cited by 0Abstract and details only

Abstract

Abstract—Context-adaptive binary arithmetic coding is a widespread technique in the field of image and video coding. Most state-of-the-art arithmetic coders produce a (long) codeword of a priori unknown length. Its generation requires a renormalization procedure to permit progressive processing. This paper intro-duces two arithmetic coders that produce multiple codewords of fixed length. Contrarily to the traditional approach, the genera-tion of fixed-length codewords does not require renormalization since the whole interval arithmetic is stored in the coder’s internal registers. The proposed coders employ a new context-adaptive mechanism based on variable-size sliding window that estimates with high precision the probability of the symbols coded. Their integration in coding systems is straightforward as demonstrated within the framework of JPEG2000. Experimental tests indicate that the proposed coders are computationally simpler than the MQ coder of JPEG2000 and the M coder of HEVC while achieving superior coding efficiency. Index Terms—Context-adaptive binary arithmetic coding, fixed-length arithmetic codes.

Cite this paper

APA 7

Member, S. (2016). 1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords.

MLA 9

Member, Senior. “1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords.” 2016.

Chicago

Member, Senior. 2016. “1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords.”

Harvard

Member, S. (2016) ‘1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords’.

BibTeX

@article{member20161context,
  title = {{1Context-adaptive Binary Arithmetic Coding with Fixed-length Codewords}},
  author = {Member, Senior},
  year = {2016}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.