Fast scheduling and allocation algorithms for entropy CODEC

Katsuharu Suzuki*, Nozomu Togawa, Masao Sato, Tatsuo Ohtsuki


研究成果: Article査読


Entropy coding/decoding are implemented on FPGAs as a fast and flexible system in which high-level synthesis technologies are key issues. In this paper, we propose scheduling and allocation algorithms for behavioral descriptions of entropy CODEC. The scheduling algorithm employs a control-flow graph as input and finds a solution with minimal hardware cost and execution time by merging nodes in the control-flow graph. The allocation algorithm assigns operations to operators with various bit lengths. As a result, register-transfer level descriptions are efficiently obtained from behavioral descriptions of entropy CODEC with complicated control flow and variable bit lengths. Experimental results demonstrate that our algorithms synthesize the same circuits as manually designed within one second.

ジャーナルIEICE Transactions on Information and Systems
出版ステータスPublished - 1997 1月 1

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能


「Fast scheduling and allocation algorithms for entropy CODEC」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。