Dynamic pipeline design of an adaptive binary arithmetic coder

Shiann Rong Kuang, Jer Min Jou*, Ren Der Chen, Yeu Horng Shiau

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

15 Scopus citations

Abstract

Arithmetic coding is an attractive technique for loss-less data compression but it tends to be slow. In this paper, a dynamic pipelined very large scale integration architecture with high performance for on-line adaptive binary arithmetic coding is presented. To obtain a high throughput pipelined architecture, we first analyze the computation flow of the coding algorithm and modify the operations whose data and/or control dependencies cause the difficulties in pipelining. Then, a novel technique called dynamic pipelining is developed to pipeline the coding process with variant (or run-time determined) pipeline latencies (or data initialization intervals) efficiently. As for data path design, a systematic design methodology of high level synthesis and a less-area but faster fixed-width multiplier are applied, which make the architecture with a little additional hardware. The dynamic pipelined architecture has been designed and simulated in Verilog HDL, and its layout has also been implemented with the 0.8μm SPDM CMOS process and the ITRI-CCL cell library. Its simulated compression speeds under working frequencies of 25 and 50 MHz are about 6 and 12.5 Mb/s, respectively. About two times the speedup with 30% hardware overhead relative to the original sequential one is achieved.

Original languageEnglish
Pages (from-to)813-825
Number of pages13
JournalIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Volume48
Issue number9
DOIs
StatePublished - 09 2001
Externally publishedYes

Keywords

  • Arithmetic coding
  • Data compression
  • Dynamic pipeline

Fingerprint

Dive into the research topics of 'Dynamic pipeline design of an adaptive binary arithmetic coder'. Together they form a unique fingerprint.

Cite this