Gate-Level Register Relocation in Generalized Synchronous Framework for Clock Period Minimization

2007 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
Under the assumption that clock can be inputted to each register at an arbitrary timing, the minimum feasible clock period can be determined if delays between registers are given. This minimum feasible clock period might be reduced by register relocation maintaining the circuit behavior and topology. In this paper, we propose a gate-level register relocation method to reduce the minimum feasible clock period. The proposed method is a greedy local circuit modification method. We prove that the
more » ... oposed method achieves the clock period achieved by retiming with delay decomposition, if the delay of each element in the circuit is unique. Experiments show that the computation time of the proposed method and the number of registers of a circuit obtained by the proposed method are smaller than those obtained by the retiming method in the conventional synchronous framework. key words: register relocation, retiming, clock period minimization, generalized synchronous framework
doi:10.1093/ietfec/e90-a.4.800 fatcat:3bzle6tev5hvvc7vmhk443zrfu