Transformation from asynchronous finite state machines to signal transition graphs for speed-independent circuit synthesis

속도 독립 회로 합성을 위한 비동기 유한 상태기로부터 신호전이 그래프로의 변환

We suggest a transform method form asynchronous finite state machines (AFSMs) into signal transition graphs (STGs) for speed-independent circuit synthesis. Existing works synthesize nodes in the state graph increases exponentially as the number of input and output signals increases. To overcome the problem of the exponential data complexity, we transform AFSMs into STGs so that the previous synthesis algorihtm form STGs can be applied.Accoridng to the experimental results, it turns out that our synthesis method produces more efficient circuit than the previous synthesis methods.