首页> 外文期刊>ACM Transactions on Design Automation of Electronic Systems >Initializability analysis of synchronous sequential circuits
【24h】

Initializability analysis of synchronous sequential circuits

机译:同步时序电路的可初始化性分析

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

摘要

This article addresses the problem of initializing synchronous sequential circuits, that is, of generating the shortest sequence able to drive the circuit to a known state, regardless of the initial state. Logic initialization is considered, being the only one compatible with current commercial tools. A hybrid Genetic Algorithm is proposed, which combines general ideas from evolutionary computation with specific techniques, well suited to the addressed problem. For the first time, experimental results provide data about the complete set of ISCAS'89 circuits, and show that, despite the inherent algorithm incompleteness, the method is capable of finding the optimum result for the considered circuits. A prototypical tool implementing the algorithm found better results than previous methods.
机译:本文解决了初始化同步时序电路的问题,即生成能够将电路驱动到已知状态的最短序列,而与初始状态无关的问题。逻辑初始化被认为是唯一与当前商用工具兼容的逻辑。提出了一种混合遗传算法,该算法将进化计算的一般思想与特定技术相结合,非常适合所解决的问题。实验结果首次提供了有关ISCAS'89电路完整集的数据,并表明,尽管固有的算法不完整,该方法仍能够为所考虑的电路找到最佳结果。实现该算法的原型工具比以前的方法发现了更好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号