Steiner Tree Based Routing Algorithm in Consideration of Optical Proximity Correction
暂无分享,去创建一个
[1] Andrew B. Kahng,et al. Subwavelength lithography and its potential impact on design and EDA , 1999, DAC '99.
[2] H. Hopkins. On the diffraction theory of optical images , 1953, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.
[3] Li-Da Huang,et al. Optical proximity correction (OPC)-friendly maze routing , 2004, Proceedings. 41st Design Automation Conference, 2004..
[4] Rui Shi,et al. The selection and creation of the rules in rules-based optical proximity correction , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).
[5] Hiroichi Kawahira,et al. Development of a fast line width correction system , 2000 .
[6] Yao-Wen Chang,et al. Multilevel full-chip gridless routing considering optical proximity correction , 2005, ASP-DAC.
[7] M. Levenson,et al. Improving resolution in photolithography with a phase-shifting mask , 1982, IEEE Transactions on Electron Devices.
[8] Ting-Chi Wang,et al. Maze routing with OPC consideration , 2005, Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005..
[9] Yang Wang,et al. Algorithm for yield driven correction of layout , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).