Generalized multiplication-free arithmetic codes

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

- Arithmetic coding is a highly efficient lossless source coding technique. Multiplication-free arithmetic coding algorithms provide an excellent tradeoff between operation complexity and coding performance. In this letter, a whole family of multiplication-free arithmetic codes, which achieve the best coding efficiency and can be used for arbitrary size of alphabets, is derived. The complete tradeoff between the complexity of operations and compression performance of all the algorithms is presented.

Original languageEnglish (US)
Pages (from-to)497-501
Number of pages5
JournalIEEE Transactions on Communications
Volume45
Issue number5
DOIs
StatePublished - 1997

Bibliographical note

Funding Information:
Paper approved by E. Ayanoglu, the Editor for Communication Theory and Coding Applications of the IEEE Communications Society. Manuscript received June 27, 1996; revised July 1, 1996 and October 14, 1996. This work was supported by the Office of Naval Research under Contract N00014-91-J1008. This paper was presented in part at the IEEE International Symposium on Circuits and Systems (ISCAS’95), Seattle, WA, May 1995.

Keywords

  • Code space alignment
  • Multiplication-free arithmetic coding algorithms
  • Source coding
  • Truncation founding

Fingerprint

Dive into the research topics of 'Generalized multiplication-free arithmetic codes'. Together they form a unique fingerprint.

Cite this