【24h】

Evolutionary Synthesis of VLSI Circuits with Fault Complementing

机译:具有故障补全的VLSI电路的进化综合

获取原文
获取原文并翻译 | 示例

摘要

The synthesis of VLSI circuits provides a challenging problem for CAD designers. This is due the continuous increase in the complexity of such circuits and the discontinuous nature of the search space associated with their synthesis. This complexity is further increased when CAD tools are required to provide designs under a number of criteria. For example, synthesis for power as well as area and speed constraints. Genetic Algorithms (GAs) have been successfully used for the synthesis of VLSI circuits under multiple design constraints . One problem with most search techniques including genetic algorithms is being trapped in local minima, which significantly delays the search process. Authors in the literature have proposed a number of techniques for overcoming this problem. These mainly suggest the modification of genetic operators and/or the adoption of specialised selection strategies. However, experience shows that a genetic algorithm performs best when problem specific techniques are incorporated within their operators. Examples are [6] and [7]. Experience shows mat most GA based synthesis systems reach a circuit, which is 80-90% correct within the first 10% of the total GA runtime. The rest of the time is spent in identifying the portion of the circuit responsible for the remaining 20-10%. This leads to a significant increase in the synthesis time. In this paper the authors report on a technique for overcoming this delay, hence enabling a GA to reach a solution within a relatively short time, when compared to conventional GA based approaches to the synthesis problem. The technique is based on identifying a group of individuals, which dominate the population of the GA at an early stage. This is followed by a process of identifying input sequences which lead to a faulty output state and complementing these via a process which involves the use of XOR gates. These designs are fed back to the population of the GA, which carries on with the evolution process. During this process the GA utilises additional optimisation functions mainly for reducing area and operation time inflected at the fault complementing stage.
机译:VLSI电路的综合为CAD设计人员提出了具有挑战性的问题。这是由于这种电路的复杂性的不断增加以及与它们的合成有关的搜索空间的不连续性。当需要CAD工具提供许多标准的设计时,这种复杂性会进一步增加。例如,功率,面积和速度约束的综合。遗传算法(GA)已成功用于多种设计约束下的VLSI电路综合。大多数搜索技术(包括遗传算法)的一个问题被困在局部极小值中,这极大地延迟了搜索过程。文献中的作者已经提出了许多技术来克服这个问题。这些主要建议修改遗传操作员和/或采用专门的选择策略。但是,经验表明,如果将特定于问题的技术纳入其运算符,则遗传算法的效果最佳。例子是[6]和[7]。经验表明,大多数基于GA的综合系统都可以到达电路,在总GA运行时间的前10%内正确率是80-90%。其余时间用于确定电路中负责其余20-10%的部分。这导致合成时间显着增加。在本文中,作者报告了一种克服此延迟的技术,因此与传统的基于GA的综合方法相比,GA可以在相对较短的时间内达到解决方案。该技术基于识别一组个体,这些个体在早期阶段主导着GA的群体。接下来是识别导致错误输出状态的输入序列的过程,并通过涉及使用XOR门的过程对其进行补充。这些设计被反馈给GA的总体,并随着进化的过程而继续进行。在此过程中,GA利用了其他优化功能,主要是为了减少在故障补充阶段受到影响的面积和运行时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号