Decompositional method for coding the states of a parallel automaton
Automatic Control and Computer Sciences
A kernel-finding state assignment algorithm for multi-level logic
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Introduction to Switching Theory and Logical Design
Introduction to Switching Theory and Logical Design
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Benchmarking in digital circuit design
MINO'08 Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics
Benchmarking in digital circuit design automation
WSEAS Transactions on Circuits and Systems
| Hi-index | 0.00 |
Optimal state assignment is one of the most important problems in the automatic synthesis of sequential machines. State assignment approaches can be divided into: structural (that construct "suboptimal" assignments). and statistical (that generate assignments). We developed and implemented a new structural method. Analyzing the factors that influence the quality of assignments and performing experiments, we concluded that the distribution of solutions is close to a normal distribution. We introduced some probabilistic quality measures for assignments and assignment methods and we applied them both to the structural and random approach.We compared both approaches and indicated that the difficulty in evaluating the quality of an assignment by statistical approach is the main reason why structural approaches can be more efficient than statistical ones.