ECO-Map: Technology remapping for post-mask ECO using simulated annealing
暂无分享,去创建一个
[1] Carl Sechen,et al. VLSI Placement and Global Routing Using Simulated Annealing , 1988 .
[2] Jason Cong,et al. Incremental CAD , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[3] Artur Balasinski. Optimization of sub-100-nm designs for mask cost reduction , 2004 .
[4] Shih-Chieh Chang,et al. Logic Synthesis for Engineering Change , 1999, 32nd Design Automation Conference.
[5] Koichiro Ishihara,et al. Incremental Logic Synthesis through Gate Logic Structure Identification , 1986, 23rd ACM/IEEE Design Automation Conference.
[6] Igor L. Markov,et al. Automating post-silicon debugging and repair , 2007, ICCAD 2007.
[7] William H. Kautz,et al. Fault Testing and Diagnosis in Combinational Digital Circuits , 1968, IEEE Transactions on Computers.
[8] R. H. J. M. Otten,et al. The Annealing Algorithm , 1989 .
[9] Majid Sarrafzadeh,et al. Timing-driven placement using design hierarchy guided constraint generation , 2002, ICCAD 2002.
[10] Ibrahim N. Hajj,et al. Diagnosis and Correction of Logic Design Errors in Digital Circuits , 1993, 30th ACM/IEEE Design Automation Conference.
[11] Massoud Pedram,et al. An integrated logical and physical design flow for deep submicron circuits , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[12] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[13] Robert K. Brayton,et al. Engineering change in a non-deterministic FSM setting , 1996, 33rd Design Automation Conference Proceedings, 1996.
[14] Jens Vygen,et al. Legalizing a placement with minimum total movement , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[15] Yao-Wen Chang,et al. ECO timing optimization using spare cells , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.
[16] Miodrag Potkonjak,et al. Engineering change: methodology and applications to behavioral and system synthesis , 1999, DAC '99.
[17] 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).
[18] P. R. Stephan,et al. SIS : A System for Sequential Circuit Synthesis , 1992 .
[19] Martin D. F. Wong,et al. An ECO algorithm for eliminating crosstalk violations , 2004, ISPD '04.
[20] Malgorzata Marek-Sadowska,et al. Engineering change using spare cells with constant insertion , 2007, ICCAD.
[21] Robert K. Brayton,et al. A redesign technique for combinational circuits based on gate reconnections , 1994, ICCAD.
[22] Yiu-Chung Wong,et al. A scalable and accurate rectilinear Steiner minimal tree algorithm , 2008, 2008 IEEE International Symposium on VLSI Design, Automation and Test (VLSI-DAT).
[23] Kotaro Hirano,et al. Rectification of Multiple Logic Design Errors in Multiple Output Circuits , 1994, 31st Design Automation Conference.
[24] Igor L. Markov,et al. Reap what you sow: spare cells for post-silicon metal fix , 2008, ISPD '08.
[25] Jarrod A. Roy,et al. ECO-system: Embracing the Change in Placement , 2007, 2007 Asia and South Pacific Design Automation Conference.