Circuit enhancement by eliminating long false paths

The authors propose to identify and perform logic replacement for a portion; called a segment, of a long path instead of the path itself. This results in less gate and lead duplication and hence reduction in the increase of circuit area. They give sufficient conditions for the choice of segments that can maintain the performance of the circuit. If the restriction on the choice of segments is relaxed then two very effective heuristics are obtained for removing long false paths. The experimental results show that the proposed algorithm and heuristics are feasible for large designs and the increase in circuit area is significantly reduced.<<ETX>>

[1]  David Hung-Chang Du,et al.  An efficient parallel critical path algorithm , 1991, DAC '91.

[2]  Robert K. Brayton,et al.  Performance enhancement through the generalized bypass transform , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[3]  S. M. Reddy,et al.  A test generation system for path delay faults , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[4]  Hugo De Man,et al.  Timing verification using statically sensitizable paths , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  David Hung-Chang Du,et al.  Path sensitization in critical path problem , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[6]  Alexander Saldanha,et al.  Is redundancy necessary to reduce delay? , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..