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
Exact minimisation of large multiple output FPRM functions
Lingli Wang,A. E. A. Almaini +1 more
TL;DR: The properties of the polarity for sum-of-products (SOP) expressions of Boolean functions are formally investigated and the effect of SOP polarity is to reorder the on-set minterms of a Boolean function.
Proceedings ArticleDOI
On logic synthesis of conventionally hard to synthesize circuits using genetic programming
TL;DR: A method of minimization of multi-level logic networks which can solve these difficult circuit instances using a search algorithm called Cartesian genetic programming (CGP), which is able to implicitly discover new efficient circuit structures.
Proceedings ArticleDOI
Design for testability and testing of IEEE 1149.1 TAP controller
TL;DR: The design techniques simplify the procedure to test the TAP controller by orders of magnitude compared to previously published results and can be easily automated and incorporated into test tools.
Proceedings ArticleDOI
ToPoliNano: A synthesis and simulation tool for NML circuits
TL;DR: This work presents a tool for automatic synthesis and simulation of NanoMagnetic Logic circuits using ToPoliNano, which is highly modular and customizable, the possibility to explore and analyze realistic and complex NML circuits will be greatly improved.
Proceedings ArticleDOI
Minimal majority gate mapping of 4-variable functions for quantum cellular automata
TL;DR: An improved majority gate logic synthesis technique is proposed and a total of 143 four-variable standard functions and their majority gate implementations are presented and can be incorporated in the majority gate synthesis tools giving more efficient logic implementations.
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.