Incremental placement algorithm for standard-cell layout
暂无分享,去创建一个
Zhuoyuan Li | Jun Gu | Xianlong Hong | Weimin Wu | Weimin Wu | Zhuoyuan Li | Xianlong Hong | Jun Gu
[1] Amit Chowdhary,et al. Technology mapping for field-programmable gate arrays , 1997 .
[2] Majid Sarrafzadeh,et al. An incremental floorplanner , 1999, Proceedings Ninth Great Lakes Symposium on VLSI.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Massoud Pedram,et al. Timing-driven placement based on partitioning with dynamic cut-net control , 2000, DAC.
[5] Jason Cong,et al. An implicit connection graph maze routing algorithm for ECO routing , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).
[6] Jason Cong,et al. Depth optimal incremental mapping for field programmable gate arrays , 2000, DAC.
[7] Nozomu Togawa,et al. An incremental placement and global routing algorithm for field-programmable gate arrays , 1998, Proceedings of 1998 Asia and South Pacific Design Automation Conference.
[8] Oliver Chiu-sing Choy,et al. Incremental layout placement modification algorithms , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[9] Bryan D. Ackland,et al. Physical Design Automation of Vlsi Systems , 1988 .
[10] Jason Cong,et al. Incremental physical design , 2000, ISPD '00.
[11] John M. Emmert,et al. Incremental routing in FPGAs , 1998, Proceedings Eleventh Annual IEEE International ASIC Conference (Cat. No.98TH8372).