DAGON: technology binding and local optimization by DAG matching
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
General decomposition of sequential machines: relationships to state assignment
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
State assignment using a new embedding method based on an intersecting cube theory
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
A unified approach for the synthesis of self-testable finite state machines
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
State assignment for hardwired VLSI control units
ACM Computing Surveys (CSUR)
Efficent suboptimal state assignment for large sequential machines
EURO-DAC '90 Proceedings of the conference on European design automation
Synthesis of multi-level logic with one symbolic input
EURO-DAC '91 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
We present a new algorithm for state assignment designed for use with multi-level logic optimization algorithms. The algorithm encodes states to select good common factors (kernels) in the final combinational logic. Encoding is performed on a programmable-encoding machine model, which models state codes as machine inputs and allows logic optimization algorithms to be performed directly on the unencoded logic. We discuss our experiments with the algorithm and with other methods of state assignment.