Efficient connected-index finite-length arithmetic codes

Din Yuen Chan, Jar-Ferr Yang, Sheng Yih Chen

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last nonfitting symbol into the current and subsequent codewords. The proposed arithmetic codes, which limit the error propagation in about one block, require neither a post-appended end-of-block symbol, nor pre-affixed side-information, to characterize the number of encoded symbols. Hence, the proposed finite-length arithmetic codes can nearly achieve the coding efficiency attained by infinite-length arithmetic codes. With high coding efficiency, limited error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-speed network systems.

Original languageEnglish
Pages (from-to)581-593
Number of pages13
JournalIEEE Transactions on Circuits and Systems for Video Technology
Volume11
Issue number5
DOIs
Publication statusPublished - 2001 May 1

Fingerprint

HIgh speed networks

All Science Journal Classification (ASJC) codes

  • Media Technology
  • Electrical and Electronic Engineering

Cite this

@article{de599b459a474b1197c97d2ef745bdc0,
title = "Efficient connected-index finite-length arithmetic codes",
abstract = "In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last nonfitting symbol into the current and subsequent codewords. The proposed arithmetic codes, which limit the error propagation in about one block, require neither a post-appended end-of-block symbol, nor pre-affixed side-information, to characterize the number of encoded symbols. Hence, the proposed finite-length arithmetic codes can nearly achieve the coding efficiency attained by infinite-length arithmetic codes. With high coding efficiency, limited error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-speed network systems.",
author = "Chan, {Din Yuen} and Jar-Ferr Yang and Chen, {Sheng Yih}",
year = "2001",
month = "5",
day = "1",
doi = "10.1109/76.920188",
language = "English",
volume = "11",
pages = "581--593",
journal = "IEEE Transactions on Circuits and Systems for Video Technology",
issn = "1051-8215",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Efficient connected-index finite-length arithmetic codes. / Chan, Din Yuen; Yang, Jar-Ferr; Chen, Sheng Yih.

In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 11, No. 5, 01.05.2001, p. 581-593.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient connected-index finite-length arithmetic codes

AU - Chan, Din Yuen

AU - Yang, Jar-Ferr

AU - Chen, Sheng Yih

PY - 2001/5/1

Y1 - 2001/5/1

N2 - In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last nonfitting symbol into the current and subsequent codewords. The proposed arithmetic codes, which limit the error propagation in about one block, require neither a post-appended end-of-block symbol, nor pre-affixed side-information, to characterize the number of encoded symbols. Hence, the proposed finite-length arithmetic codes can nearly achieve the coding efficiency attained by infinite-length arithmetic codes. With high coding efficiency, limited error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-speed network systems.

AB - In this paper, we propose a connected-index approach to construct efficient finite-length arithmetic codes by splitting the information of the last nonfitting symbol into the current and subsequent codewords. The proposed arithmetic codes, which limit the error propagation in about one block, require neither a post-appended end-of-block symbol, nor pre-affixed side-information, to characterize the number of encoded symbols. Hence, the proposed finite-length arithmetic codes can nearly achieve the coding efficiency attained by infinite-length arithmetic codes. With high coding efficiency, limited error-propagation, and the regular process, the proposed coding approach is suitable for information exchange with small packets in modern high-speed network systems.

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

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

U2 - 10.1109/76.920188

DO - 10.1109/76.920188

M3 - Article

VL - 11

SP - 581

EP - 593

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

SN - 1051-8215

IS - 5

ER -