This paper presents an efficient state assignment algorithm that utilizes a pattern matching technique to predict races and to eliminate the need for enumerative searches. This algorithm has been evaluated using several representative examples.
Results show that the developed algorithm provides better performance than existing algorithms.
Due to the simplicity of the bipartite representation of an n-cube, the developed algorithm is suitable for ASLC synthesis that may involve a relatively large number of states. All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .