A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
In this paper, we consider the state assignment problem as that of the decomposition of finite state machines and transform this decomposition problem into an orthogonal partitioning problem with a certain cost function. We attempt to justify this cost function in two ways, first by using an idealized model of multi-level logic implementation, and second by empirical studies of a particular benchmark circuit. We describe a greedy algorithm to minimize this cost function. We present resultsdoi:10.1109/iccd.1999.808606 dblp:conf/iccd/ShelarDN99 fatcat:huk6jues75cgdhw7y4oia2jnci