Direct Synthesis of Efficient Speed-independent Circuits from Deterministic Signal Transition Graphs

This paper presents a new algorithm which synthesizes a speed-independent circuit from a deterministic Signal Transition Graph(STG) representation which satisfies safeness, liveness and unique state coding property. Existing works translate a higher level description such as a nondeterministic STG representation into a State Graph(SG) representation and then translate the SG representation into a speed-independent circuit. In contrast, our algorithm synthesizes a speed-independent circuit directly from the STG representation by analyzing the relations between the signal transitions in the representation. It turns out that our algorithm yields more efficient circuits than the existing works. Also, it turns out that the run time of our algorithm is, in most cases, faster than that of the existing works