An efficient for the sequential general decomposition of sequential machines

Sequential machines which derine control and serial processing units of modern digital systems are large and complex and, therefore, difficult to design, implement, optimize and verify. So, methods and CAD-tools that can decompose complex machines have attracted a great deal of interest recently. In this paper, a heuristic method is presented for suboptimal multiple-objective sequential general decomposition of sequential machines into submachines with limited input/output bits, product terms and state variables. The experimental results obtained from the prototypic implementation of the method show that the method is efficient. It produces high quality decompositions using relatively small memory and in an appropriately short time. The method is flexible and after some modifications can be applied to other decomposition problems.

[1]  Lech L Jozwiak,et al.  The full decomposition of sequential machines with the state and output behaviour realization , 1988 .

[2]  Srinivas Devadas,et al.  Decomposition and factorization of sequential finite state machines , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  J. Hartmanis,et al.  Algebraic Structure Theory Of Sequential Machines , 1966 .

[4]  I. S. Levin.  A hierarchical model of the interaction of microprogrammed automata , 1987 .

[5]  Juris Hartmanis,et al.  Symbolic Analysis of a Decomposition of Information Processing Machines , 1960, Inf. Control..

[6]  Srinivas Devadas,et al.  Performance-oriented decomposition of sequential circuits , 1990, IEEE International Symposium on Circuits and Systems.

[7]  Y. Hou,et al.  Trinity Algebra and its Application to Machine Decompositions , 1987, Inf. Process. Lett..

[8]  K. Thulasiraman,et al.  MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis , 1989 .

[9]  Lech Jozwiak,et al.  The bit full-decomposition of sequential machines , 1989 .

[10]  Y Yibin Hou.  Trinity algebra and full-decompositions of sequential machines , 1986 .

[11]  Pawel Winter.  An algorithm for the enumeration of spanning trees , 1986, BIT Comput. Sci. Sect..

[12]  Lech L Jozwiak,et al.  Full decomposition of sequential machines with the output behaviour realization , 1988 .

[13]  Lech L Jozwiak,et al.  The full-decomposition of sequential machines with the separate realization of the next-state and output functions , 1989 .

[14]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[15]  Lech Jóźwiak,et al.  Simultaneous decompositions of sequential machines , 1990, Microprocessing and Microprogramming.

[16]  Srinivas Devadas,et al.  General Decomposition of Sequential Machines: Relationships to State Assignment , 1989, 26th ACM/IEEE Design Automation Conference.