Symbolic hazard-free minimization and encoding of asynchronous finite state machines
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
New methods to color the vertices of a graph
Communications of the ACM
Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
Exact Dichotomy-based Constrained Encodi
ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
XBM2PLA: A Flexible Synthesis Tool for Extended Burst Mode Machines
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
| Hi-index | 0.00 |
One essential step in sequential logic synthesis consists of finding a state encoding that meets some requirements, such as optimal implementation, or correctness in the case of asynchronous FSMs. Dichotomy-based constrained encoding is more general than other constrained encoding frameworks, but it is also more difficult to solve. This paper introduces a new formalization of this problem, which leads to original exact and heuristic algorithms. Experimental results show that the resulting exact solver outperforms the previous approaches.