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
A probabilistic method for the computation of testability of RTL constructs
TL;DR: This work presents a static, non-simulation based, method for the determination of the controllability of RTL constructs that is efficient and gives accurate feedback to the designers in what regards the presence of hard to control constructs in their RTL code.
Journal ArticleDOI
Hierarchical buffered routing tree generation
TL;DR: This paper presents a solution to the problem of performance-driven buffered routing tree generation for very large scale integrated circuits using a novel bottom-up construction algorithm and a local neighborhood search strategy that finds the optimum solution in an exponential-size solution subspace.
Journal ArticleDOI
An ATPG Method for Double Stuck-At Faults by Analyzing Propagation Paths of Single Faults
TL;DR: This paper shows the case where test patterns for single faults are sufficient to cover all multiple faults, and explains in which conditions some of the multiple faults may be overlooked, and proposes a method that can efficiently generate the complete test set for double faults without traversing all the faults.
Journal ArticleDOI
Graphene nanoribbon crossbar architecture for low power and dense circuit implementations
Morteza Gholipour,Nasser Masoumi +1 more
TL;DR: Simulation results of benchmark circuits using SIS synthesis tool indicate that the GNR-based crossbar circuits outperform conventional CMOS circuits in low power applications.
ReportDOI
Breadth-First with Depth-First BDD Construction: A Hybrid Approach,
TL;DR: The technique of operator sifting is presented as a new way of understanding both breadth- first and depth-first approaches to BDD construction and a new algorithm is proposed to capture the breadth-first approach's advantage of memory access locality, while keeping the depth- first approach'sadvantage of low memory overhead.
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.