摘要： 介绍用遗传算法对门阵列布局设计进行优化的新方法。由于门阵列布局是一排列问题,传统的遗传杂交会导致门的重复,因此必须对传统的遗传算法进行修改。为了适合优化门阵列布局问题,这里使用了宽度搜索技术。用遗传算法得出的染色体建立门的相互排列邻接关系,宽度值用于限制搜索空间,使搜索更为有效。该算法的结果比基于图论的启发式计算效果更好。

关键词: 互补型金属氧化物半导体, 门阵列布局, 遗传算法

Abstract: This paper presents a noval implementation of the genetic algorithm in combination with beam search for gate matrix layout.This is a permutation problem,for which the traditional genetic crossover operator results in repetition of gates.To adapt it to the gate matrix layout problem,the principles of beam search have been used.The gate are ranked according to their connectivity with each other,and the ranks of the gates to be placed next to each other to a low value. The algorithm produces better results compared to results on published netlists[1].

中图分类号: 

• TN402