Generalized multiplication-free arithmetic codes

Research output: Contribution to journalArticle

7 Citations (Scopus)

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

Generalized multiplication-free arithmetic codes. / Fu, Bin; Parhi, Keshab K.

In: IEEE Transactions on Communications, Vol. 45, No. 5, 01.12.1997, p. 497-501.

Research output: Contribution to journalArticle

@article{9bd1d12f35294cbf9291218819531057,
title = "Generalized multiplication-free arithmetic codes",
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.",
keywords = "Code space alignment, Multiplication-free arithmetic coding algorithms, Source coding, Truncation founding",
author = "Bin Fu and Parhi, {Keshab K}",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/26.592545",
language = "English (US)",
volume = "45",
pages = "497--501",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Generalized multiplication-free arithmetic codes

AU - Fu, Bin

AU - Parhi, Keshab K

PY - 1997/12/1

Y1 - 1997/12/1

N2 - - 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.

AB - - 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.

KW - Code space alignment

KW - Multiplication-free arithmetic coding algorithms

KW - Source coding

KW - Truncation founding

UR - http://www.scopus.com/inward/record.url?scp=0031139478&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031139478&partnerID=8YFLogxK

U2 - 10.1109/26.592545

DO - 10.1109/26.592545

M3 - Article

VL - 45

SP - 497

EP - 501

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 5

ER -