The bit full-decomposition of sequential machines
01 Jan 1989-
TL;DR: It is proved, that the bit full- decomposition can be treated as a special case of the symbol full-decomposition; therefore, no new decomposition theory is needed for this case, but the symbolFulldecompositions theory together with the theorems introduced here constitute the theory of bitFullDecomposition.
Abstract: Control units and serial processing units of today's information processing systems must realize complex processes, which are usually described in the form of a sequential machine or a number of cooperating sequential machines. Large machines are difficult to: design, optimize, implement and verify. Therefore, there is a real need for CAD tools, which could decompose a complex sequential machine into a number of smaller and less complicated partial machines. For many years, the decomposition of only the internal states of sequential machines has been studied. However, this sort of decomposition is not a sUfficient solution. The complexity of a circuit implementing a sequential machine is a function not only of machine's internal states but as well of inputs and outputs. Furthermore, the possibility to implement a machine with today's array logic building blocks depends not only on the number of internal states but as well on inputs and outputs. So, there is a real need for decompositions upon the states, inputs and outputs of a sequential machine, i.e. for fulldecompositions. During the full-decomposition process, the input and/or state and/or output symbols (values) can be decomposed or the input and/or state and/or output bits. So, it is possible to perform the symbol fulldecomposition or the bit full-decomposition. This report provides the classification of full-decompositions and describes briefly the theoretical foundations of bit fulldecomposition. Comparing to the symbol full-decomposition,the bit fulldecomposition has the following advantage: input and output decoders are reduced to an appropriate distribution of the primary input and output bits between the partial machines. In the report, definitions of a bit partition and bit partition pairs are introduced and their usefulness to bit full-decompositions is shown. It is proved, that the bit full-decomposition can be treated as a special case of the symbol full-decomposition; therefore, no new decomposition theory is needed for this case, but the symbol fulldecomposition theory together with the theorems introduced here constitute the theory of bit full-decomposition. Finally, a comparison is made between the symbol and the bit fulldecompositions and some practical conclusions and remarks are presented. In the appendix, an example is provided that illustrates the possibility and the practical usefulness of bit full-decomposition. Based on the developed theory, the CAD algorithms calculating different bit full-decompositions have been developed and implemented. Those algorithms and the practical results are presented and estimated in the separate paper [5]. Index Terms Automata theory, decomposition, logic design, sequential machines. Acknowledgements The author is indebted to Prof. ir. A. Heetman and Prof. ir. M. P.J. Stevens for making it possible to perform this work, to Dr. P.R. Attwood for making corrections to the English text and to mr. C. van de Watering for typing the text.
Citations
More filters
TL;DR: The fundamentals of a logic design methodology which meets the requirements of today's complex circuits and modem building blocks are presented and the decomposition methodology that is presented ensures “correctness by construction” and enables very effective and efficient post-factum validation.
Abstract: Modem microelectronic technology.gives opportunities to build digital circuits of huge complexity and provides a wide diversity of logic building blocks. Although logic designers have been building circuits for many years, they have realized that advances in microelectronic technology are outstripping their abilities to make use of the created opportunities. In this paper, we present the fundamentals of a logic design methodology which meets the requirements of today's complex circuits and modem building blocks. The methodology is based on the theory of general full-decompositions which constitutes the theory of digital circuit structures at the highest abstraction level. The paper explains the theory and shows how it can be used for digital circuit synthesis. The decomposition methodology that is presented ensures “correctness by construction” and enables very effective and efficient post-factum validation. It makes possible extensive examination of the structural features of the required information processing in relation to a given set of objectives and constraints.
46 citations
Additional excerpts
...A general composition GC of n sequential machines defines the general composition machine M6c(GC) M6c({Mi }, { Coni }) (IGc, SGC, OGC, GC, k6C) with I6c Ii, SGC Si, OGC Oi, GC (SGc’XGc) GC ((S1 Sn), (X1 Xn)) i(Si, (Xi’ Cni(Yl Yn)), hGC(SGc, XGC) hGc((S Sn), (X1 Xn)) hi(si, (Xi’ Cni(Yl Yn))" Formal definitions for compositions TC of various special types T can be introduced in a very similar way, as special cases of the above definition [22]-[25]....
[...]
...9); bitfull-decompositions [25]-[27], where the decod-...
[...]
TL;DR: 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 and shows that it is efficient and flexible.
22 citations
TL;DR: The aim of this paper is to analyze and compare the general decomposition approach and the division-based approach to solve the multiple-level synthesis problem with different minimum functionally complete systems of primitive logic blocks.
Abstract: During the last decade, many different approaches have been proposed to solve the multiple-level synthesis problem with different minimum functionally complete systems of primitive logic blocks. The most popular of them is the division-based approach. However, modem microelectronic technology provides a large variety of building blocks which considerably differ from those typically considered. The traditional methods are therefore not suitable for synthesis with many modem building blocks. Furthermore, they often fail to find global optima for complex designs and leave unconsidered some important design aspects. Some of their weaknesses can be eliminated without leaving the paradigm they are based on, other ones are more fundamental. A paradigm which enables efficient exploitation of the opportunities created by the microelectronic technology is the general decomposition paradigm. The aim of this paper is to analyze and compare the general decomposition approach and the division-based approach. The most important advantages of the general decomposition approach are its generality (any network of any building blocks can be considered) and totality (all important design aspects can be considered) as well as handling the incompletely specified functions in a natural way. In many cases, the general decomposition approach gives much better results than the traditional approaches.
19 citations
TL;DR: The theoretical and practical results that were obtained in the field of simultaneous decompositions which divide the process described by a given sequential machine into a number of interacting parallel partial processes, each implemented by one partial machine are described.
18 citations
01 Jan 1989
TL;DR: A special full-decomposition strategy is investigated, which has several advantages comparing to the case where a sequential machine is considered as a unit, and can be directly used in order to develope programs computing different sorts of decompositions for sequential machines.
Abstract: The decomposition theory of sequential machines aims to find answers to the following important practical problem: how to decompose a complex sequential machine into a number of simpler partial machines in order to: simplify the design, implementation and verification process; make it possible to process (to optimize, to implement, to test, ••. ) the separate partial machines al though it may be impossible to process the whole machine with existing tools; make it possible to implement the machine with existing building blocks or inside of a limited silicon area. For many years, decomposition of the internal states of sequential machines has been investigated. Here, decomposition of the states, as well as, the inputs and outputs of sequential machines is considered, i.e. full-decomposition. In [16], classification of full-decompositions is presented and theorems about the existence of different full-decompositions are provided. In this report a special full-decomposition strategy is investigated the full-decomposition of sequential machines with the separate realization of the next-state and output functions. This strategy has several advantages comparing to the case where a sequential machine is considered as a unit. In the report, the results of theoretical investigations are presented; however, the notions and theorems provided here have straightforward practical interpretations and they can be directly used in order to develope programs computing different sorts of decompositions for sequential machines. INDEX TERMS Automata theory, decomposition, logic system design, sequential machines. ACKNOWLEDGEMENTS The author is indebted to Prof. ir. A. Heetman and Prof. ir. M. P.J. Stevens for making it possible to perform this work, to Dr. P.R. Attwood for making corrections to the English text and to mr. C. van de Watering for typing the text.
17 citations
References
More filters
01 Jan 1989
TL;DR: A fully-described program in Pascal has been included and serves a two-fold purpose: it exposes concrete practical solutions, which encourages the reader to try other strategies on his (her) own, and allows to check the correctness of different theoretic concepts emerging from the Method of Maximal Adjacencies.
Abstract: One of the central problems in the physical realization of sequential machines is the selection of binary codes to represent the internal states of the machine. The Method of Maximal Adjacencies can be viewed as an approach to the state assignment problem. This research report concentrates on simple, practical strategies to implement that method. A fully-described program in Pascal has been included and serves a two-fold purpose: (1) it exposes concrete practical solutions, which encourages the reader to try other strategies on his (her) own; (2) it has been conceived from a general standpoint that allows to check the correctness of different theoretic concepts emerging from the Method of Maximal Adjacencies. A set of industrial sequential machines has been chosen to test the program. Results from other existing methods have been also reported.
12 citations
TL;DR: Partition trinity and trinity algebra efficiently give the information dependence between inputs, states, and outputs within a triple of partitions, and they serve as a powerful tool to the full-decompositions of machines.
12 citations
01 Jan 1989
TL;DR: In this paper, the authors present a general full-decomposition of type PO ••••••••••••••• and a serial fulldecompositions of type NS •••••• •.
Abstract: CONTENTS 1. Introduction. . • • . . • • • • • • • • • • • . • • • • • • • • • • • • • • • • • • . • • • . •• 2 2. Full-decompositions and their sorts .••••••••••••••••••• 4 3. Partitions, partition pairs and partition trinities •••• 14 4. Parallel full-decomposition •••••••••••••••••••••••••••• 17 5. Serial full-decomposition of type PS ••••••••.•••••••••• 19 6. Serial full-decomposition of type NS ••••••••••.•••••••• 22 7. Serial full-decomposition of type PO ••••••••••••••••••• 26 8. Serial full-decomposition of type NO ••••••••••••••••••• 29 9. General full-decomposition of type PS •••••••••••••••••• 33 10. General full-decomposition of type PO •••••••.•••.•.•••• 35 11. Conclusion ••..•.•.••••••••.••..••..•••.••.••••••••••.•• 37
11 citations
01 Jan 1989
TL;DR: In this article, the authors propose a method to solve the problem of "uniformity" and "uncertainty" in the context of health care, and propose a solution.
Abstract: 1
10 citations
01 Jan 1986
TL;DR: The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
Abstract: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
9 citations