A high-level synthesis approach to partial scan design based on acyclic structure

A scheduling method in high-level synthesis for acyclic partial scan design

“…In order to take the number of scan registers into account during the above-mentioned minimum clique partitioning, by focusing on the fact that sharing may cause a loop, Takasaki et al [12] represented the strength or possibility of the requirement for scan registers as a weight on an edge in the compatibility graph, and presented an algorithm for finding a minimum weighted clique partitioning.…”

“…Thus, the problem (minimizing the number of scan registers with the minimum number of resources) is solved by finding a minimum clique partitioning such that the sum of weights of the cliques is minimum. 1 In [12], the weight is specified in more detail according to the scheduled control steps of operations and the number of variables between them. However, we need not such a specified weight in the following discussion, partitioning.…”

“…In [12], edges´v 1 v 2 µ in compatibility graph G C are classified into three cases based on the relation of two operations v 1 and v 2 in the scheduled DFG G sD , and accordingly edges are weighted as follows 1 . v 1 and v 2 are adjacent.…”

“…In order to estimate the number of scan registers during scheduling, we propose provisional binding of operational units, and show a force-directed scheduling algorithm [13] with the provisional binding. Experimental results show that the combination of the scheduling algorithm with the provisional binding and the binding algorithm [12] can further reduce the number of scan registers for acyclic structure compared to that of the scheduling algorithm without the provisional binding and the binding algorithm for some example DFGs.…”

“…Takasaki et al [12] proposed a binding algorithm for minimizing the number of scan registers so as to make the kernel acyclic for a given scheduled data flow graph (DFG) or behavior description while keeping the area/performance optimality. Experimental results in [12] show that the binding method can minimize the number of scan registers for many scheduled DFGs. In this paper, we propose a scheduling method for reducing the number of scan registers for acyclic structure.…”