Sequential Circuit Equivalence Checking Method Based on Minimizing Automation

Article Preview

Abstract:

A parallel checking method is proposed in the paper, in order to improve the speed of sequential circuit checking. The graph form of sequential circuits is isomorphic to finite state machine; a parallel sequential circuit equivalence checking method is designed using parallel minimization method of finite state machine. At last, the effectiveness and feasibility of the method is proved with an instance.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 204-210)

Pages:

251-254

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] van Eijk C A J. Sequential equivalence checking based on structural similarities[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, 19(7): 814-819.

DOI: 10.1109/43.851997

Google Scholar

[2] Anastasakis D, Damiano R, Ma H-K T. A practical and efficient method for compare-point matching[C]/Proceedings of Design Automation Conference, New Orleans, 2002: 305-310.

DOI: 10.1109/dac.2002.1012640

Google Scholar

[3] Lu F, Iyer M K, Parthasarathy G. An efficient sequential SAT solver with improved search strategies[C]/Proceedings of the Design, Automation and Test in Europe Conference and Exhibition, Munich, 2005: 1102-1107.

DOI: 10.1109/date.2005.55

Google Scholar

[4] Sun Yuqiang. Parallel Processing of Minimization Algorithm for Determination Finite Automata . Proceedings of ICIC2007,. Qingdao, 2007. 8 P811-816.

Google Scholar

[5] Lu Ying, Li Hui. Equivalence Checking Algorithm Based on State Transition Graph. Computer Technology and development. 2009(3): 74-76.

Google Scholar