scientific article; zbMATH DE number 1014082

From MaRDI portal
Publication:4337945





This book is the second of a set of two monographs (for the first see above) devoted to the synthesis of finite state machines. This volume addresses logical optimization and contains 11 chapters. Chapter 1 is introductory. Chapter 2 provides basic definitions regarding finite state machines, discrete functions, two-level minimization of discrete functions and Boolean networks. Chapter 3 considers computational complexity of some key problems in logic minimization and assignment. Chapter 4 gives optimal encoding of inputs and outputs of a logical function and the states of a finite state assignment program based on the techniques discussed. Applications of decomposition theory of state assignment are discussed. Chapter 5 presents two-level symbolic minimization procedures capable of exploring minimal symbolic covers by using face, dominance and disjunctive constrainments. The case of state assignment of finite state machines is considered. The experimental results are presented. Chapter 6 presents algorithms to check encodability of sets of encoding constraints including face, dominance, disjunctive, conjunctive-disjunctive constraints. Chapters 7 and 8 introduce generalized prime implicants which are counter part in symbolic minimization of two-level logic to prime implicants in two-valued minimization. Optimum state assignment for two-level implementation is solved by finding a minimum encodable cover of generalized prime implicant. The theory of encodability of generalized prime implicants based on the notion of raising graphs and updating sets is considered in Chapter 9. Chapter 10 shows how to solve implicitly unate covering problems. In Chapter 11 implicit algorithms to generate and compute minimum encodable sets of generalized prime implicants are presented.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337945)