Open AccessJournal Article
SIS : A System for Sequential Circuit Synthesis
Reads0
Chats0
TLDR
This paper provides an overview of SIS and contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph] manipulation, and synthesis for PGA’s (programmable gate arrays).Abstract:
SIS is an interactive tool for synthesis and optimization of sequential circuits Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output behavior Many different programs and algorithms have been integrated into SIS, allowing the user to choose among a variety of techniques at each stage of the process It is built on top of MISII [5] and includes all (combinational) optimization techniques therein as well as many enhancements SIS serves as both a framework within which various algorithms can be tested and compared, and as a tool for automatic synthesis and optimization of sequential circuits This paper provides an overview of SIS The first part contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays) The second part contains a tutorial example illustrating the design process using SISread more
Citations
More filters
Journal ArticleDOI
Using Flexibility in P-Circuits by Boolean Relations
TL;DR: This paper shows that to explore all solutions to characterizing and exploiting the complete flexibility of a special logic architecture, called P-circuits, one must set up the problem as the minimization of a Boolean relation, because there are don't care conditions that cannot be expressed by single cubes.
Proceedings ArticleDOI
Flexible Two-Level Boolean Minimizer BOOM-II and Its Applications
Petr Fiser,Hana Kubatova +1 more
TL;DR: A novel two-level Boolean minimizer coming in succession to the previously developed minimizer BOOM, so it is named BOOM-II, which is a combination of two minimizers, namely BOOM and FC-Min.
Proceedings ArticleDOI
Cost-driven selection of parity trees
TL;DR: This work presents a systematic search approach that exploits the correlation between the hardware cost of a function and its entropy, in order to select parity trees that minimize the incurred cost, while achieving lossless compaction.
Journal ArticleDOI
Formal Verification based on Boolean Expression Diagrams
TL;DR: This dissertation examines the use of a new data structure called Boolean Expression Diagrams (BEDs) in the area of formal verification, which allows fast and efficient manipulation of Boolean formulae and presents a method for verifying equivalence between two such circuits.
Dissertation
FSM state-assignment for area, power and testability using non-deterministic evolutionary heuristics
TL;DR: English) xvii Abstract (Arabic) XviiiArabic Arabic xviii as discussed by the authors, Arabic Arabic Arabic Xvii, English English Arabic XVIII.
References
More filters
Journal ArticleDOI
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Book
Logic Minimization Algorithms for VLSI Synthesis
TL;DR: The ESPRESSO-IIAPL as discussed by the authors is an extension of the ESPRSO-IIC with the purpose of improving the efficiency of Tautology and reducing the number of blocks and covers.
Journal ArticleDOI
MIS: A Multiple-Level Logic Optimization System
TL;DR: An overview of the MIS system and a description of the algorithms used are provided, including some examples illustrating an input language used for specifying logic and don't-cares.
Dissertation
Synthesis of self-timed vlsi circuits from graph-theoretic specifications
TL;DR: This thesis presents an approach for direct and efficient synthesis of self-timed (asynchronous) control circuits from formal specifications called Signal Transition Graphs (STGs), and develops a number of analytical results which establish the equivalence between the static structure of nets and their underlying firing sequence semantics.