Automatic synthesis of gate-level timed circuits with choice
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An exact minimizer for Boolean relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Practical asynchronous controller designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Basic gate implementation of speed-independent circuitsPublished by Association for Computing Machinery (ACM) ,1994
- Synthesis of timed asynchronous circuitsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1993
- Semi-modularity and testability of speed-independent circuitsIntegration, 1992
- A new algorithm for the binate covering problem and its application to the minimization of Boolean relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Algorithms for synthesis of hazard-free asynchronous circuitsPublished by Association for Computing Machinery (ACM) ,1991
- Automatic synthesis of asynchronous circuits from high-level specificationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965