Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding

Dongchang Yu, Michael W Marcellin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.

Original languageEnglish (US)
Title of host publicationData Compression Conference Proceedings
EditorsJ.A. Storer, M. Cohn
PublisherIEEE
Pages310-316
Number of pages7
StatePublished - 1997
EventProceedings of the 1997 Data Compression Conference, DCC'97 - Snowbird, UT, USA
Duration: Mar 25 1997Mar 27 1997

Other

OtherProceedings of the 1997 Data Compression Conference, DCC'97
CitySnowbird, UT, USA
Period3/25/973/27/97

Fingerprint

Entropy
Viterbi algorithm
Computational complexity

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Yu, D., & Marcellin, M. W. (1997). Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding. In J. A. Storer, & M. Cohn (Eds.), Data Compression Conference Proceedings (pp. 310-316). IEEE.

Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding. / Yu, Dongchang; Marcellin, Michael W.

Data Compression Conference Proceedings. ed. / J.A. Storer; M. Cohn. IEEE, 1997. p. 310-316.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, D & Marcellin, MW 1997, Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding. in JA Storer & M Cohn (eds), Data Compression Conference Proceedings. IEEE, pp. 310-316, Proceedings of the 1997 Data Compression Conference, DCC'97, Snowbird, UT, USA, 3/25/97.
Yu D, Marcellin MW. Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding. In Storer JA, Cohn M, editors, Data Compression Conference Proceedings. IEEE. 1997. p. 310-316
Yu, Dongchang ; Marcellin, Michael W. / Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding. Data Compression Conference Proceedings. editor / J.A. Storer ; M. Cohn. IEEE, 1997. pp. 310-316
@inproceedings{640c7ff339b8499bb12a98edb38d3d54,
title = "Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding",
abstract = "A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.",
author = "Dongchang Yu and Marcellin, {Michael W}",
year = "1997",
language = "English (US)",
pages = "310--316",
editor = "J.A. Storer and M. Cohn",
booktitle = "Data Compression Conference Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Fixed-rate quantizer using block-based entropy-constrained quantization and run-length coding

AU - Yu, Dongchang

AU - Marcellin, Michael W

PY - 1997

Y1 - 1997

N2 - A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.

AB - A fast and efficient quantization technique is described. It is fixed-length, robust to bit errors, and compatible with most current compression standards. It is based on entropy-constrained quantization and uses the well-known and efficient Viterbi algorithm to force the coded sequence to be fixed-rate. Run-length coding techniques are used to improve the performance at low encoding rates. Simulation results show that it can achieve performance comparable to that of Huffman coded entropy-constrained scalar quantization with computational complexity increasing only linearly in block length.

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

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

M3 - Conference contribution

AN - SCOPUS:0030671647

SP - 310

EP - 316

BT - Data Compression Conference Proceedings

A2 - Storer, J.A.

A2 - Cohn, M.

PB - IEEE

ER -