Clock schedule design for minimum realization cost
A semi-synchronous circuit is a circuit ill which the clock is assumed tu be distributed periodically to each individual register, though not necessarily to all registers simultaneously. In this paper, we propose atl algorithm to achieve the target clock period by modifying a given target clock schedule as small as possible, where the realization cost of the target clock schedule is assumed to be minimum. The proposed algorithm iteratively improves a feasible clock schedule. The algorithm finds a set of registers that can reduce the cost by changing their clock timings with same amount, and changes the clock timing with optimal amount. Experiments show that the algorithm achieves the target clock period with fewer modifications.
clock schedule semi-synchronous circuit clock tree