An efficient for the sequential general decomposition of sequential machines

L. Jóźwiak, J.C. Kolsteren

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Scopus)

Abstract

Sequential machines which derïne 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.

Original languageEnglish
Pages (from-to)657-664
Number of pages8
JournalMicroprocessing and Microprogramming
Volume32
Issue number1-5
DOIs
Publication statusPublished - Aug 1991

Fingerprint Dive into the research topics of 'An efficient for the sequential general decomposition of sequential machines'. Together they form a unique fingerprint.

  • Cite this