Generalized multiplication-free arithmetic codes

Research output: Contribution to journalArticle

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 - Dec 1 1997

Keywords

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

Cite this