Lp Based Cell Selection With Constraints Of Timing, Area, And Power Consumption
暂无分享,去创建一个
[1] Yen-Tai Lai,et al. A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[2] Trevor N. Mudge,et al. CheckT/sub c/ and minT/sub c/: timing verification and optimal clocking of synchronous digital circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.
[3] Michel Berkelaar,et al. Computing The Entire Active Area /power Consumption Versus Delay Trade-Off Curve For Gate Sizing With A Piecewise Linear Simulator , 1994, IEEE/ACM International Conference on Computer-Aided Design.
[4] Kurt Keutzer. DAGON: Technology Binding and Local Optimization by DAG Matching , 1987, DAC.
[5] Robert K. Brayton,et al. MIS: A Multiple-Level Logic Optimization System , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[6] Robert K. Brayton,et al. Minimum padding to satisfy short path constraints , 1993, ICCAD '93.
[7] Robert K. Brayton,et al. Minimum padding to satisfy short path constraints , 1993, ICCAD.
[8] Mrcm Michel Berkelaar. Area-power-delay trade-off in logic synthesis , 1992 .
[9] Yen-Tai Lai,et al. A graph-based simplex algorithm for minimizing the layout size and the delay on timing critical paths , 1993, ICCAD.