跳到主要导航 跳到搜索 跳到主要内容

An algorithm for identifying the recurring subcircuits

  • Li Xiaobai*
  • , Qin Honglei
  • , Iang Rongling
  • *此作品的通讯作者
  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

The problem of detecting the given subsystems in complex circuits is now an important problem in the computer aided design of VLSI. The algorithm for solving the problem of detecting recurring subsystems is presented in this paper. The algorithm is structure independent, namely any circuit which can be described as a digraph can be handled by this algorithm. The computational complexity is reduced by dividing the algorithm into four phases, such as preprocessing, locating, decomposing and labeling. The experiment results indicate that the run time of the algorithm is influenced by the parameters of graphs.

源语言英语
主期刊名Proceedings of the 9th Joint Conference on Information Sciences, JCIS 2006
DOI
出版状态已出版 - 2006
活动9th Joint Conference on Information Sciences, JCIS 2006 - Taiwan, ROC, 中国台湾
期限: 8 10月 200611 10月 2006

出版系列

姓名Proceedings of the 9th Joint Conference on Information Sciences, JCIS 2006
2006

会议

会议9th Joint Conference on Information Sciences, JCIS 2006
国家/地区中国台湾
Taiwan, ROC
时期8/10/0611/10/06

学术指纹

探究 'An algorithm for identifying the recurring subcircuits' 的科研主题。它们共同构成独一无二的学术指纹。

引用此