期刊文献+

基于遗传模拟退火算法的门阵列布局方法 被引量:7

Gate Array Placement Method Based on Genetic Simulated Annealing Algorithm
下载PDF
导出
摘要 为实现门阵列模式布局,将遗传算法与模拟退火算法相结合,提出一种新的遗传模拟退火算法,利用遗传算法进行全局搜索,利用模拟退火法进行局部搜索,在进化过程中采用精英保留策略,对进化结果进行有选择的模拟退火操作,既加强了局部搜索能力又防止陷入局部最优。实验结果表明,与传统遗传算法相比,该算法能够有效提高全局搜索能力。 In order to implement gate array mode placement,Genetic Algorithm(GA) is combined with Simulated Annealing(SA) algorithm. A novel GASA algorithm is proposed. The GA is served as the main flow of the new algorithm for global search,while the SA algorithm adjusts local search. In this process,excellent results are retained and simulated annealing,which strengthens capabilities of local search and avoids trapping in the local optimum. Experimental results show that,compared with traditional GA,this algorithm can promote the global search capacity effectively.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第2期184-185,188,共3页 Computer Engineering
基金 安徽省高校青年教师基金资助项目(2008jq1004) 合肥工业大学科学研究发展基金资助项目(061006F) 合肥工业大学教学研究基金资助项目(xyb2007022)
关键词 门阵列 布局 遗传算法 模拟退火 gate array placement Genetic Algorithm(GA) Simulated Annealing(SA)
  • 相关文献

参考文献5

  • 1Hou Wenting, Yu Hong, Hong Xianlong, et al. A New Congestion-driven Placement Algorithm Based on Cell Inflation[J]. Chinese Journal of Semiconductors, 2001, 22(3): 275-285.
  • 2Sechen C. Efficient and Effective Placement for Very Large Circuits[J]. IEEE Trans. on Computer-Aided Design, 1995, 14(3): 349-350.
  • 3Moon B R. Dynamic Embedding for Genetic VLSI Circuit Portioning[J]. Engineering Applications of Artificial Intelligence, 1998, 3(5): 67-76.
  • 4Cohoon J .P. Genetic Placement[J]. IEEE Trans. on Computer-Aided Design, 1987, 6(6): 956-964.
  • 5南国芳,李敏强,寇纪淞.基于适应性模拟退火的标准单元布局算法[J].系统仿真学报,2006,18(3):550-553. 被引量:4

二级参考文献11

  • 1Bo Yao, Wenting Hou, Xianlong Hong, Yici Cai. FAME: A Fast Detailed Placement Algorithm for Standard Cell Layout Based on Mixed Min-cut and Enumeration [J]. Journal of Semiconductors,2000, 21 (8): 744-753. (In Chinese)
  • 2Terai M, Takahashi K, Sato K. A new min-cut placement algorithm for timing assurance layout design meeting net length constrain [C]//Design Automation Conference, Orlando: IEEE Computer Society,1990:96-102.
  • 3Saurabh Adya, Igor Markov, Villarrubia P G, Improving Min-cut Placement for VLSI Using Analytical Techniques [C]//IBM ACAS Conference. Austin: IEEE Computer Society Press, 2003:55-62.
  • 4Alupoaei S, Katkoori S, Net-based force-directed macrocell placement for wirelength optimization [J]. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on (S 1063-8210),2002, 10( 6): 824-835.
  • 5Suit S M, Youssef H, Barada H R, AI-Yamani A, A parallel tabu search algorithm for VLSI standard-cell placement [C]// Circuits and Systems. the 2000 IEEE International Symposium on. Geneva :Press Polytechniques et Universitaries Romandes, 2000: 2: 581-584.
  • 6Manikas T W, Mickle M H, A genetic algorithm for mixed macro and standard cell placement [J]. Circuits and Systems(S1057-7130), 2002,2: 4-7.
  • 7Valenzuela C L, Wang P Y, VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions [J].Evolutionary Computation, IEEE Transactions on, (S1089-778X),2002, 6(4): 390-401.
  • 8Aykanat C, Bultan T, Haritaoglu o, A fast neural-network algorithm for VLSI cell placement [J]. Neural Networks (S1045-9227), 1998,11: 1671-1684.
  • 9Hentschke R F, Reis R A, Improving simulated annealing placement by applying random and greedy mixed perturbations [C]//Proceedings of the 16th symposium on Integrated circuits and systems design,Washington: IEEE Computer Society, 2003:267 - 272.
  • 10Lihong Zhang, Kleine U, A genetic approach to analog module placement with simulated annealing [J]. Circuits and Systems(S1057-7130), 2002, 1: 345-348.

共引文献3

同被引文献60

引证文献7

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部