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
Proceedings ArticleDOI
Provably good algorithm for low power consumption with dual supply voltages
Chunhong Chen,Majid Sarrafzadeh +1 more
TL;DR: This paper relates the voltage-scaling power optimization to the maximal weighted independent set (MWIS) problem, which is polynomial-time solvable on a transitive graph, and develops a provably good lower-bound algorithm based on MWIS to generate the lower bound of the power consumption.
Journal ArticleDOI
Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions
Jordi Cortadella,Michael Kishinevsky,Steven M. Burns,Alex Kondratyev,Luciano Lavagno,Kenneth S. Stevens,Alexander Taubin,Alex Yakovlev +7 more
TL;DR: The paper presents the necessary conditions to generate circuits and a synthesis algorithm that exploits the timing assumptions for optimization and proposes a method for back-annotation that derives a set of sufficient timing constraints that guarantee the correctness of the circuit.
Journal ArticleDOI
Logic Minimization and Testability of 2-SPP Networks
TL;DR: A heuristic algorithm is presented for the synthesis of 2-SPP networks in a form that is fully testable in the stuck-at fault model (SAFM), which extends the EXPAND-IRREDUNDANT-REDUCE paradigm of ESPRESSO in heuristic mode, and it iterates local minimization and reshape of a solution until no further improvement can be achieved.
Proceedings ArticleDOI
Concurrent fault detection in random combinational logic
Petros Drineas,Yiorgos Makris +1 more
TL;DR: This work discusses a non-intrusive methodology for concurrent fault detection in random combinational logic which achieves significant hardware overhead reduction, while detecting all faults with very low average fault detection latency.
Journal ArticleDOI
Low power state assignment and flipflop selection for finite state machine synthesis: a genetic algorithmic approach
TL;DR: The author explores the avenue of genetic algorithm for a holistic view for synthesis of finite state machine (FSM) targeting power reduction by incorporating both state assignment and sequential element selection.
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.