CAJ | 학술논문

针对数字IC规律性提取算法复杂度过高的问题,提出一种逐级对根节点进行分类的算法.通过对频繁边的直接扩展,实现了小规模频繁子电路的快速提取;利用门级电路中小规模频繁子电路与大规模频繁子电路间的结构依赖性,解决了候选子电路生成时根节点组合爆炸的问题.实验结果表明,该算法能够降低根节点的数量,使支持度高的候选子电路得到优先提取,并显著地减少了规律性提取的时间.
침대수자IC규률성제취산법복잡도과고적문제,제출일충축급대근절점진행분류적산법.통과대빈번변적직접확전,실현료소규모빈번자전로적쾌속제취;이용문급전로중소규모빈번자전로여대규모빈번자전로간적결구의뢰성,해결료후선자전로생성시근절점조합폭작적문제.실험결과표명,해산법능구강저근절점적수량,사지지도고적후선자전로득도우선제취,병현저지감소료규률성제취적시간.
To cope with the problem of high complexity in extraction of functional regularity in digital ICs, an algorithm capable of categorizing the root nodes gradually is proposed. By extending the frequent edges directly, the small frequent subcircuits can be extracted fast; and utilizing structure dependencies between small frequent subcircuits and big ones at gate level, the combination explosion problem of root nodes has been solved in the process of generating candidate subcircuits. Experimental results show that the proposed algorithm can reduce the number of root nodes effectively, extract the high frequency candidate subcircuits with high priority and reduce runtime of regularity extraction observably.