An efficient for the sequential general decomposition of sequential machines

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

18 Citaten (Scopus)

Samenvatting

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.

Originele taal-2Engels
Pagina's (van-tot)657-664
Aantal pagina's8
TijdschriftMicroprocessing and Microprogramming
Volume32
Nummer van het tijdschrift1-5
DOI's
StatusGepubliceerd - aug 1991

Vingerafdruk

Duik in de onderzoeksthema's van 'An efficient for the sequential general decomposition of sequential machines'. Samen vormen ze een unieke vingerafdruk.

Citeer dit