Minimum padding to satisfy short path constraints
暂无分享,去创建一个
[1] Wentai Liu,et al. Timing constraints for wave-pipelined systems , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2] Robert K. Brayton,et al. Resynthesis of Multi-Phase Pipelines , 1993, 30th ACM/IEEE Design Automation Conference.
[3] John P. Fishburn,et al. LATTIS: an iterative speedup heuristic for mapped logic , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.
[4] John P. Fishburn. A depth-decreasing heuristic for combinational logic: or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between , 1991, DAC '90.
[5] Robert K. Brayton,et al. Performance-oriented technology mapping , 1990 .
[6] Giovanni De Micheli,et al. Inserting active delay elements to achieve wave pipelining , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[7] P. G. Paulin,et al. Logic decomposition algorithms for the timing optimization of multi-level logic , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[8] C. Leonard Berman,et al. The fanout problem: from theory to practice , 1989 .
[9] Robert K. Brayton,et al. Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.
[10] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] N. S. Barnett,et al. Private communication , 1969 .