Fast Scheduling and Allocation Algorithms for Entropy CODEC

Katsuharu SUZUKI  Nozomu TOGAWA  Masao SATO  Tatsuo OHTSUKI  

IEICE TRANSACTIONS on Information and Systems   Vol.E80-D   No.10   pp.982-992
Publication Date: 1997/10/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design)
Category: High Level Synthesis
entropy CODEC,  scheduling,  allocation,  control-flow graph,  

Full Text: PDF(806.4KB)>>
Buy this 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.