Decomposition of timed decision tables and its use in presynthesis optimizations
Jian Li, Rajesh K. Gupta · eScholarship (California Digital Library) · 1997
In this paper we introduce the decomposition of Timed Decision Tables (TDT), a tabular model of system behavior. The decomposition can be used in system partitioning or in HDL code restructuring to improve synthesis results. The TDT decomposition is based on the kernel extraction algorithm. By experimenting using named benchmarks, we demonstrate how TDT decomposition can be used in presynthesis optimizations. Presynthesis optimizations transform a behavioral HDL description into optimized HDL description that results in improved synthesized circuits. 1 Introduction Presynthesis optimizations have been introduced in [1] as source-level transformations that produce "better" HDL descriptions. For instance, these transformations are used to reduce control-flow redundancies and make synthesis result relatively insensitive to the HDL coding-style. They are also used to reduce resource requirements in the synthesized circuits by increasing component sharing at the behavior-level [2]. The TDT...